Generalized Delaunay Triangulation for Planar Graphs.
D.T. Lee, A.K. Lin (1986)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs.”
Generalized Delaunay Triangulation for Planar Graphs.
A Left-First Search Algorithm for Planar Graphs.
J. Pach, H. de Fraysseix, P.O. de Mendez (1995)
Discrete & computational geometry
Similarity:
Area Requirement and Symmetry Display of Planar Upward Drawings.
R. Tamassia, G. di Battista, I.G. Toms (1992)
Discrete & computational geometry
Similarity:
Establishing Order in Planar Subdivisions.
D.G. Kirkpatrick (1988)
Discrete & computational geometry
Similarity:
A characterization of planar median graphs
Iztok Peterin (2006)
Discussiones Mathematicae Graph Theory
Similarity:
Median graphs have many interesting properties. One of them is-in connection with triangle free graphs-the recognition complexity. In general the complexity is not very fast, but if we restrict to the planar case the recognition complexity becomes linear. Despite this fact, there is no characterization of planar median graphs in the literature. Here an additional condition is introduced for the convex expansion procedure that characterizes planar median graphs.
A Unified Approach to Visibility Representations of Planar Graphs.
R. Tamassia, Ioannis G. Tollis (1986)
Discrete & computational geometry
Similarity:
A note on the Ramsey number and the planar Ramsey number for C₄ and complete graphs
Halina Bielak (1999)
Discussiones Mathematicae Graph Theory
Similarity:
We give a lower bound for the Ramsey number and the planar Ramsey number for C₄ and complete graphs. We prove that the Ramsey number for C₄ and K₇ is 21 or 22. Moreover we prove that the planar Ramsey number for C₄ and K₆ is equal to 17.
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
Július Czap, Jakub Przybyło, Erika Škrabuľáková (2016)
Discussiones Mathematicae Graph Theory
Similarity:
A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets. Bipartite 1-planar graphs are known to have at most 3n − 8 edges, where n denotes the order of a graph. We show that maximal-size bipartite 1-planar graphs which are almost balanced have not significantly fewer edges than indicated by this upper bound, while the same...
Can Visibility Graphs Be Represented Compactly?.
N. Alon, S. Suri, P.K. Agarwal, B. Aronov (1994)
Discrete & computational geometry
Similarity:
Remarks on the existence of uniquely partitionable planar graphs
Mieczysław Borowiecki, Peter Mihók, Zsolt Tuza, M. Voigt (1999)
Discussiones Mathematicae Graph Theory
Similarity:
We consider the problem of the existence of uniquely partitionable planar graphs. We survey some recent results and we prove the nonexistence of uniquely (𝓓₁,𝓓₁)-partitionable planar graphs with respect to the property 𝓓₁ "to be a forest".
Disjoint Edges in Geometric Graphs.
P. Erdös, N. Alon (1989)
Discrete & computational geometry
Similarity:
Characterizations of planar plick graphs
V.R. Kulli, B. Basavanagoud (2004)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper we present characterizations of graphs whose plick graphs are planar, outerplanar and minimally nonouterplanar.
Computing a Centerpoint of a Finite Planar Set of Points in Linear Time.
A. Mukhopadhyay, S. Jadhav (1994)
Discrete & computational geometry
Similarity:
An Equipartition of Planar Sets.
L.J. Schulman (1993)
Discrete & computational geometry
Similarity: