Results 11 to 20 of about 1,410,460 (300)
Journal of Graph Algorithms and Applications, 2009 In this paper we give a simple algorithm to generate all connected rooted plane graphs with at most m edges. A rooted" plane graph is a plane graph with one designated (directed) edge on the outer face.
Katsuhisa Yamanaka, Shin-ichi Nakano
doaj +2 more sources
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.
Marcin Kaminski 0001 +2 more
openaire +7 more sources
On the Hamiltonian Number of a Plane Graph [PDF]
Discussiones Mathematicae Graph Theory, 2019 The Hamiltonian number of a connected graph is the minimum of the lengths of the closed spanning walks in the graph. In 1968, Grinberg published a necessary condition for the existence of a Hamiltonian cycle in a plane graph, formulated in terms of the ...
Lewis Thomas M.
doaj +2 more sources
On Visibility Representation of Plane Graphs [PDF]
, 2004 In a visibility representation (VR for short) of a plane graph G, each vertex of G is represented by a horizontal line segment such that the line segments representing any two adjacent vertices of G are joined by a vertical line segment. Rosenstiehl and Tarjan [11], Tamassia and Tollis [14] independently gave linear time VR algorithms for 2-connected ...
Huaming Zhang, Xin He 0005
openaire +2 more sources
Splitting Plane Graphs to Outerplanarity
Journal of Graph Algorithms and Applications, 2023 Vertex splitting replaces a vertex by two copies and partitions its incident edges amongst the copies. This problem has been studied as a graph editing operation to achieve desired properties with as few splits as possible, most often planarity, for ...
Martin Gronemann +2 more
doaj +4 more sources
On the Plane-Width of Graphs [PDF]
Electronic Notes in Discrete Mathematics, 2009 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
Looseness of Plane Graphs [PDF]
Graphs and Combinatorics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Július Czap +3 more
openaire +3 more sources
Folding Equilateral Plane Graphs [PDF]
International Journal of Computational Geometry & Applications, 2011 We consider two types of folding applied to equilateral plane graph linkages. First, under continuous folding motions, we show how to reconfigure any linear equilateral tree (lying on a line) into a canonical configuration. By contrast, it is known that such reconfiguration is not always possible for linear (nonequilateral) trees and for (nonlinear ...
Abel, Zachary Ryan +6 more
openaire +6 more sources
Polychromatic Colorings of Plane Graphs [PDF]
Discrete & Computational Geometry, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noga Alon +7 more
openaire +7 more sources
Graph polynomials and paintability of plane graphs
Discrete Applied Mathematics, 2022 There exists a variety of coloring problems for plane graphs, involving vertices, edges, and faces in all possible combinations. For instance, in the \emph{entire coloring} of a plane graph we are to color these three sets so that any pair of adjacent or incident elements get different colors.
Jaroslaw Grytczuk +2 more
openaire +3 more sources