Results 11 to 20 of about 391,866 (285)
Plane elementary bipartite graphs
Discrete Applied Mathematics, 2000 A connected graph is elementary if the union of all perfect matchings induces a connected subgraph. It is well known that a connected bipartite graph is elementary if and only if it is \(1\)-extendable, i.e., each edge is contained in a perfect matching. In this paper the authors mainly study properties of plane elementary bipartite graphs.
Zhang, HP, Zhang, FJ
openaire +5 more sources
Counting Plane Graphs: Cross-Graph Charging Schemes [PDF]
Combinatorics, Probability and Computing, 2013 We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have recently been used to obtain various properties of triangulations that are embedded in a fixed set of points in the plane.
Sharir, Micha, Sheffer, Adam
openaire +4 more sources
Looseness of Plane Graphs [PDF]
Graphs and Combinatorics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Czap, Július +3 more
openaire +3 more sources
Zig-zag facial total-coloring of plane graphs [PDF]
Opuscula Mathematica, 2018 In this paper we introduce the concept of zig-zag facial total-coloring of plane graphs. We obtain lower and upper bounds for the minimum number of colors which is necessary for such a coloring.
Július Czap +2 more
doaj +1 more source
Dualizing Distance-Hereditary Graphs
Discussiones Mathematicae Graph Theory, 2021 Distance-hereditary graphs can be characterized by every cycle of length at least 5 having crossing chords. This makes distance-hereditary graphs susceptible to dualizing, using the common extension of geometric face/vertex planar graph duality to cycle ...
McKee Terry A.
doaj +1 more source
The plane-width of graphs [PDF]
Journal of Graph Theory, 2011 Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is the minimum diameter of the image of the vertex set over all such mappings.
Kaminski, Marcin +2 more
openaire +3 more sources
Odd facial colorings of acyclic plane graphs
Electronic Journal of Graph Theory and Applications, 2021 Let G be a connected plane graph with vertex set V and edge set E. For X ∈ {V, E, V ∪ E}, two elements of X are facially adjacent in G if they are incident elements, adjacent vertices, or facially adjacent edges (edges that are consecutive on the ...
Július Czap, Peter Šugerek
doaj +1 more source
Facial unique-maximum colorings of plane graphs with restriction on big vertices [PDF]
, 2018 A facial unique-maximum coloring of a plane graph is a proper coloring of the vertices using positive integers such that each face has a unique vertex that receives the maximum color in that face. Fabrici and G\"{o}ring (2016) proposed a strengthening of
Lidicky, Bernard +3 more
core +4 more sources
Plane Graphs with Parity Constraints [PDF]
Graphs and Combinatorics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aichholzer Oswin +6 more
openaire +3 more sources
Polychromatic Colorings of Plane Graphs [PDF]
Discrete & Computational Geometry, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alon, N. +7 more
openaire +6 more sources