A sufficient condition for graphs with 1-factors
Gary Chartrand, Donald L. Goldsmith, Seymour Schuster (1979)
Colloquium Mathematicae
Similarity:
Displaying similar documents to “Note on the factors of graphs.”
A sufficient condition for graphs with 1-factors
'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:
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 technique for reconstructing disconnected graphs
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity:
On linguistic dynamical systems, families of graphs of large girth, and cryptography.
Ustimenko, V.A. (2005)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Dominant-matching graphs
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.
Restricted Eulerian circuits in directed graphs
H. W. Berkowitz (1978)
Colloquium Mathematicae
Similarity: