Results 41 to 50 of about 543,681 (314)
Strong parity vertex coloring of plane graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A strong parity vertex coloring of a 2-connected plane graph is a coloring of the vertices such that every face is incident with zero or an odd number of vertices of each color.
Tomas Kaiser +3 more
doaj +1 more source
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths [PDF]
, 2018 When can a plane graph with prescribed edge lengths and prescribed angles (from among $\{0,180^\circ, 360^\circ$\}) be folded flat to lie in an infinitesimally thin line, without crossings?
Abel, Zachary +5 more
core +2 more sources
The total face irregularity strength of some plane graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A face irregular total -labeling of a 2-connected plane graph is a labeling of vertices and edges such that their face-weights are pairwise distinct. The weight of a face under a labeling is the sum of the labels of all vertices and edges surrounding ...
Meilin I. Tilukay +3 more
doaj +1 more source
Edge Partitions of Optimal $2$-plane and $3$-plane Graphs
, 2018 A topological graph is a graph drawn in the plane. A topological graph is $k$-plane, $k>0$, if each edge is crossed at most $k$ times. We study the problem of partitioning the edges of a $k$-plane graph such that each partite set forms a graph with a ...
CSA Nash-Williams +12 more
core +1 more source
On Partitioning the Edges of 1-Plane Graphs
, 2016 A 1-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A 1-plane graph is optimal if it has maximum edge density.
Lenhart, William J. +2 more
core +1 more source
ROBUST AND ACCURATE PLANE SEGMENTATION FROM POINT CLOUDS OF STRUCTURED SCENES [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 Plane segmentation from the point cloud is an important step in various types of geo-information related to human activities. In this paper, we present a new approach to accurate segment planar primitives simultaneously by transforming it into the best ...
P. Hu, Y. Liu, M. Tian, M. Hou
doaj +1 more source
Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time
, 2016 Thomassen characterized some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph is drawable in straight-lines if and only if it does not contain the configuration [C. Thomassen, Rectilinear drawings of graphs,
A Grigoriev +12 more
core +1 more source
On the classification of plane graphs representing structurally stable rational Newton flows [PDF]
, 1991 We study certain plane graphs, called Newton graphs, representing a special class of dynamical systems which are closely related to Newton's iteration method for finding zeros of (rational) functions defined on the complex plane.
Jongen, H.Th., Jonker, P., Twilt, F.
core +4 more sources
Journal of Combinatorial Theory, Series B, 1983 AbstractIt is proven that, if Γ0 and Γ1 are isomorphic strictly convex graphs such that their outer polygons correspond to each other and have the same orientations, then Γ0 can be continuously deformed into Γ1 such that, at each stage, the graph under consideration is convex. This extends a result of Cairns (Ann of Math.
openaire +2 more sources
L-Visibility Drawings of IC-planar Graphs
, 2015 An IC-plane graph is a topological graph where every edge is crossed at most once and no two crossed edges share a vertex. We show that every IC-plane graph has a visibility drawing where every vertex is an L-shape, and every edge is either a horizontal ...
AM Dean +6 more
core +1 more source