Results 41 to 50 of about 1,410,460 (300)
, 2011 In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core +1 more source
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 +3 more sources
Orthogonal Drawings of Plane Graphs without Bends [PDF]
, 2002 In an orthogonal drawing of a plane graph G each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A point at which the drawing of an edge changes its direction is called a bend.
Rahman, Md. Saidur +5 more
core +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
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
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
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,
Seok-Hee Hong +3 more
core +1 more source
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
On the plane angle-monotone graphs
Computational Geometry, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Davood Bakhshesh, Mohammad Farshi
openaire +2 more sources
Biophysical approaches for studying viral entry
FEBS Letters, EarlyView.Viruses infect all living organisms and have been responsible for major epidemics and pandemics. Their ongoing evolutionary battle with host defenses creates a constant need for improved tools to study viral behavior. Advancing methods to probe viral attachment, fusion, and genome release deepen our understanding of how infections begin and support the
Inbar Yosibash, Raya Sorkin
wiley +1 more source