Results 21 to 30 of about 2,427,282 (299)
New results on edge partitions of 1-plane graphs [PDF]
Theoretical Computer Science, 2017 A 1 -plane graph is a graph embedded in the plane such that each edge is crossed at most once. A NIC-plane graph is a 1-plane graph such that any two pairs of crossing edges share at most one end-vertex.
E. D. Giacomo +6 more
semanticscholar +1 more source
Special Type Routing Problems in Plane Graphs
Mathematics, 2022 We considered routing problems for plane graphs to solve control problems of cutting machines in the industry. According to the cutting plan, we form its homeomorphic image in the form of a plane graph G.
Tatiana Makarovskikh, Anatoly Panyukov
doaj +1 more source
On the Geodesic Identification of Vertices in Convex Plane Graphs
, 2020 A shortest path between two vertices and in a connected graph is a geodesic. A vertex of performs the geodesic identification for the vertices in a pair if either belongs to a geodesic or belongs to a geodesic.
F. Alsaadi +5 more
semanticscholar +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
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
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
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
Enhanced boundary regularity of planar nonlocal minimal graphs and a butterfly effect
Bruno Pini Mathematical Analysis Seminar, 2020 In this note, we showcase some recent results obtained in [DSV19] concerning the stickiness properties of nonlocal minimal graphs in the plane. To start with, the nonlocal minimal graphs in the planeenjoy an enhanced boundary regularity, since boundary ...
Serena Dipierro +3 more
doaj +1 more source
Facial rainbow edge-coloring of simple 3-connected plane graphs [PDF]
Opuscula Mathematica, 2020 A facial rainbow edge-coloring of a plane graph \(G\) is an edge-coloring such that any two edges receive distinct colors if they lie on a common facial path of \(G\).
Július Czap
doaj +1 more source