A technique for reconstructing disconnected graphs
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity:
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity:
Proskurowski, Andrzej, Telle, Jan Arne (1999)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Frank, András (1998)
Documenta Mathematica
Similarity:
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
S. F. Kapoor, Linda M. Lesniak (1976)
Colloquium Mathematicae
Similarity:
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
Lynch, Christopher, Strogova Polina (1998)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
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.