Embeddings of Graphs in Euclidean Spaces.
J. Reiterman, V Rödl, E. Sinajová (1989)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Delaunay Graphs Are Almost as Good as Complete Graphs.”
Embeddings of Graphs in Euclidean Spaces.
A note on intersecting graphs.
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Chord graphs - new means for representing graphs
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
'3in1' enhanced: three squared ways to '3in1' GRAPHS
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
A technique for reconstructing disconnected graphs
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity:
A Generalized Direct Product Of Graphs
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
On Graver's Conjecture Concerning the Rigidity Problem of Graphs.
H. Maehara (1991)
Discrete & computational geometry
Similarity:
Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.
H. Maehara (1991)
Discrete & computational geometry
Similarity:
On the domination of functions by graphs
S. F. Kapoor, Linda M. Lesniak (1976)
Colloquium Mathematicae
Similarity:
Can Visibility Graphs Be Represented Compactly?.
N. Alon, S. Suri, P.K. Agarwal, B. Aronov (1994)
Discrete & computational geometry
Similarity: