Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.
H. Maehara (1991)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Nonorientable Genus of Nearly Complete Bipartite Graphs.”
Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.
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:
Embeddings of Graphs in Euclidean Spaces.
J. Reiterman, V Rödl, E. Sinajová (1989)
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:
On Graver's Conjecture Concerning the Rigidity Problem of Graphs.
H. Maehara (1991)
Discrete & computational geometry
Similarity:
Approximating Euclidean Distances by Small Degree Graphs*
José Soares (1994)
Discrete & computational geometry
Similarity:
Generalized Delaunay Triangulation for Planar Graphs.
D.T. Lee, A.K. Lin (1986)
Discrete & computational geometry
Similarity:
Classes of Graphs Which Approximate the Complete Euclidean Graph.
J.M. Keil, C.A. Gutwin (1992)
Discrete & computational geometry
Similarity:
The Thickness of Amalgamations and Cartesian Product of Graphs
Yan Yang, Yichao Chen (2017)
Discussiones Mathematicae Graph Theory
Similarity:
The thickness of a graph is the minimum number of planar spanning subgraphs into which the graph can be decomposed. It is a measurement of the closeness to the planarity of a graph, and it also has important applications to VLSI design, but it has been known for only few graphs. We obtain the thickness of vertex-amalgamation and bar-amalgamation of graphs, the lower and upper bounds for the thickness of edge-amalgamation and 2-vertex-amalgamation of graphs, respectively. We also study...
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: