Results 1 to 10 of about 543,681 (314)
On Embedding a Cycle in a Plane Graph [PDF]
Discrete Mathematics, 2006 AbstractConsider a planar drawing Γ of a planar graph G such that the vertices are drawn as small circles and the edges are drawn as thin stripes. Consider a non-simple cycle c of G. Is it possible to draw c as a non-intersecting closed curve inside Γ, following the circles that correspond in Γ to the vertices of c and the stripes that connect them? We
Pier Francesco Cortese +3 more
openalex +6 more sources
Polychromatic colorings of plane graphs [PDF]
Discrete & Computational Geometry, 2008 We show that the vertices of any plane graph in which every face is of size at least g can be colored by (3g Àý 5)=4 colors so that every color appears in every face. This is nearly tight, as there are plane graphs that admit no vertex coloring of this type with more than (3g+1)=4 colors.
Noga Alon +7 more
openalex +7 more sources
Construction of a user-friendly software-defined networking management using a graph-based abstraction layer [PDF]
PeerJ Computer ScienceThe software-defined networking (SDN) paradigm relies on the decoupling of the control plane and data plane. Northbound interfaces enable the implementation of network services through logical centralised control.
Yufeng Jia +5 more
doaj +3 more sources
On the Hamiltonian Number of a Plane Graph
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 +4 more sources
Chains and graphs of Ostrom planes [PDF]
Pacific Journal of Mathematics, 1964 J. D. Swift
openalex +4 more sources
Entire colouring of plane graphs
Journal of Combinatorial Theory, Series B, 2011 AbstractIt was conjectured by Kronk and Mitchem in 1973 that simple plane graphs of maximum degree Δ are entirely (Δ+4)-colourable, i.e., the vertices, edges, and faces of a simple plane graph may be simultaneously coloured with Δ+4 colours in such a way that adjacent or incident elements are coloured by distinct colours.
Weifan Wang, Xuding Zhu
openalex +3 more sources
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. The algorithm uses O(m) space and generates such graphs in O(1) time per graph on average without duplications.
Katsuhisa Yamanaka, Shin-ichi Nakano
openalex +4 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.
Kaminski, Marcin +2 more
openaire +5 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
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