Delaunay Graphs Are Almost as Good as Complete Graphs.
D.P. Dobkin, S.J. Friedman, K.J. Supowit (1990)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Embeddings of Graphs in Euclidean Spaces.”
Delaunay Graphs Are Almost as Good as Complete Graphs.
Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.
H. Maehara (1991)
Discrete & computational geometry
Similarity:
A note on intersecting graphs.
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
A technique for reconstructing disconnected graphs
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
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 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:
Some globally determined classes of graphs
Ivica Bošnjak, Rozália Madarász (2018)
Czechoslovak Mathematical Journal
Similarity:
For a class of graphs we say that it is globally determined if any two nonisomorphic graphs from that class have nonisomorphic globals. We will prove that the class of so called CCB graphs and the class of finite forests are globally determined.