Embeddings of Graphs in Euclidean Spaces.
J. Reiterman, V Rödl, E. Sinajová (1989)
Discrete & computational geometry
Similarity:
J. Reiterman, V Rödl, E. Sinajová (1989)
Discrete & computational geometry
Similarity:
D.P. Dobkin, S.J. Friedman, K.J. Supowit (1990)
Discrete & computational geometry
Similarity:
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity:
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
Lynch, Christopher, Strogova Polina (1998)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
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.
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".
Igor' E. Zverovich, Olga I. Zverovich (2004)
Discussiones Mathematicae Graph Theory
Similarity:
We introduce a new hereditary class of graphs, the dominant-matching graphs, and we characterize it in terms of forbidden induced subgraphs.