On prescribed connectivities in graphs
H. V. Kronk, D. R. Lick (1970)
Colloquium Mathematicae
Similarity:
Displaying similar documents to “On the theory of graphs”
On prescribed connectivities in graphs
Some remarks on chromatic graphs
P. Erdős (1967)
Colloquium Mathematicae
Similarity:
Weak cartesian product of graphs
Donald J. Miller (1970)
Colloquium Mathematicae
Similarity:
Metrization of D_E[0,1] by Hausdorff distance between graphs
Jan Kisyński (1990)
Annales Polonici Mathematici
Similarity:
'3in1' enhanced: three squared ways to '3in1' GRAPHS
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
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:
A Generalized Direct Product Of Graphs
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
A technique for reconstructing disconnected graphs
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
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.
On the domination of functions by graphs
S. F. Kapoor, Linda M. Lesniak (1976)
Colloquium Mathematicae
Similarity: