Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs.
Robert E. Tarjan, P. Rosenstiehl (1986)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Generalized Delaunay Triangulation for Planar Graphs.”
Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs.
A Left-First Search Algorithm for Planar Graphs.
J. Pach, H. de Fraysseix, P.O. de Mendez (1995)
Discrete & computational geometry
Similarity:
Can Visibility Graphs Be Represented Compactly?.
N. Alon, S. Suri, P.K. Agarwal, B. Aronov (1994)
Discrete & computational geometry
Similarity:
Disjoint Edges in Geometric Graphs.
P. Erdös, N. Alon (1989)
Discrete & computational geometry
Similarity:
Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.
H. Maehara (1991)
Discrete & computational geometry
Similarity:
Classes of Graphs Which Approximate the Complete Euclidean Graph.
J.M. Keil, C.A. Gutwin (1992)
Discrete & computational geometry
Similarity:
Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.
K. Kumar, J. Abello, O. Egecioglu (1995)
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:
Embeddings of Graphs in Euclidean Spaces.
J. Reiterman, V Rödl, E. Sinajová (1989)
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:
Establishing Order in Planar Subdivisions.
D.G. Kirkpatrick (1988)
Discrete & computational geometry
Similarity: