Results 11 to 20 of about 568,500 (305)
Isoperimetric Constants of Infinite Plane Graphs [PDF]
Discrete & Computational Geometry, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Serge Lawrencenko +2 more
openalex +4 more sources
Journal of Graph Algorithms and Applications, 2017 We introduce a new type of graph drawing called "rook-drawing". A rook-drawing of a graph $G$ is obtained by placing the $n$ nodes of $G$ on the intersections of a regular grid, such that each row and column of the grid supports exactly one node. This paper focuses on rook-drawings of planar graphs. We first give a linear algorithm to compute a planar
David Auber +3 more
openalex +4 more sources
Unique-Maximum Coloring Of Plane Graphs
Discussiones Mathematicae Graph Theory, 2016 A unique-maximum k-coloring with respect to faces of a plane graph G is a coloring with colors 1, . . . , k so that, for each face of G, the maximum color occurs exactly once on the vertices of α.
Fabrici Igor, Göring Frank
doaj +2 more sources
Facial Rainbow Coloring of Plane Graphs
Discussiones Mathematicae Graph Theory, 2019 A vertex coloring of a plane graph G is a facial rainbow coloring if any two vertices of G connected by a facial path have distinct colors. The facial rainbow number of a plane graph G, denoted by rb(G), is the minimum number of colors that are necessary
Jendroľ Stanislav, Kekeňáková Lucia
doaj +2 more sources
Dynamic graph-based quantum feature selection for accurate fetal plane classification in ultrasound imaging. [PDF]
Sci RepPriyadharshni S, Ravi V.
europepmc +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
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
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
Ars Mathematica Contemporanea, 2015 Summary: A plane graph is called alternating if all adjacent vertices have different degrees, and all neighboring faces as well. Alternating plane graphs were introduced in 2008. This paper presents the previous research on alternating plane graphs.{ }There are two smallest alternating plane graphs, having 17 vertices and 17 faces each.
Althöfer, Ingo +4 more
openaire +6 more sources
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