Results 1 to 10 of about 86,037 (264)
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
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.
Stanislav Jendroľ +2 more
exaly +3 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 +3 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 +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 +4 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
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
Total Face Irregularity Strength of Grid and Wheel Graph under K-Labeling of Type (1, 1, 0)
Journal of Mathematics, 2021 In this study, we used grids and wheel graphs G=V,E,F, which are simple, finite, plane, and undirected graphs with V as the vertex set, E as the edge set, and F as the face set.
Aleem Mughal, Noshad Jamil
doaj +1 more source
Domination number of annulus triangulations
Theory and Applications of Graphs, 2020 An {\em annulus triangulation} $G$ is a 2-connected plane graph with two disjoint faces $f_1$ and $f_2$ such that every face other than $f_1$ and $f_2$ are triangular, and that every vertex of $G$ is contained in the boundary cycle of $f_1$ or $f_2$.
Toshiki Abe +2 more
doaj +1 more source
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 +5 more sources