Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs.
Robert E. Tarjan, P. Rosenstiehl (1986)
Discrete & computational geometry
Similarity:
Displaying similar documents to “A Unified Approach to Visibility Representations of Planar Graphs.”
Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs.
Generalized Delaunay Triangulation for Planar Graphs.
D.T. Lee, A.K. Lin (1986)
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.
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".
Embeddings of Graphs in Euclidean Spaces.
J. Reiterman, V Rödl, E. Sinajová (1989)
Discrete & computational geometry
Similarity:
Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.
H. Maehara (1991)
Discrete & computational geometry
Similarity:
Delaunay Graphs Are Almost as Good as Complete Graphs.
D.P. Dobkin, S.J. Friedman, K.J. Supowit (1990)
Discrete & computational geometry
Similarity:
Can Visibility Graphs Be Represented Compactly?.
N. Alon, S. Suri, P.K. Agarwal, B. Aronov (1994)
Discrete & computational geometry
Similarity:
Straight line representations of planar graphs.
V.W. Bryant (1989)
Elemente der Mathematik
Similarity:
A Left-First Search Algorithm for Planar Graphs.
J. Pach, H. de Fraysseix, P.O. de Mendez (1995)
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.
Disjoint Edges in Geometric Graphs.
P. Erdös, N. Alon (1989)
Discrete & computational geometry
Similarity: