Results 31 to 40 of about 86,037 (264)
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
A plane graph representation of triconnected graphs
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shunsuke Ota +2 more
openaire +1 more source
Invariants of Graph Drawings in the Plane [PDF]
Arnold Mathematical Journal, 2020 48 pages, many figures.
openaire +3 more sources
Rook-Drawing for Plane Graphs [PDF]
, 2015 Motivated by visualization of large graphs, 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
Auber, David +3 more
openaire +2 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 +1 more source
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
openaire +2 more sources
Convex Grid Drawings of Plane Graphs with Rectangular Contours
Journal of Graph Algorithms and Applications, 2008 In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex grid drawing, all vertices are put on grid points.
Kazuyuki Miura +2 more
doaj +1 more source
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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Type 1 plasminogen deficiency (PLGD‐1) is an ultra‐rare autosomal recessive disorder caused by variants in the PLG gene and affects approximately 1.6 individuals per million. The condition is characterized by decreased plasminogen levels and impaired function, resulting in fibrin‐rich lesions on mucous membranes throughout the body.
Charles Nakar +7 more
wiley +1 more source
Decompositions of Plane Graphs Under Parity Constrains Given by Faces
Discussiones Mathematicae Graph Theory, 2013 An edge coloring of a plane graph G is facially proper if no two faceadjacent edges of G receive the same color. A facial (facially proper) parity edge coloring of a plane graph G is an (facially proper) edge coloring with the property that, for each ...
Czap Július, Tuza Zsolt
doaj +1 more source