The crossing numbers of some generalized Petersen graphs.
F. Harary, G. Exoo, J. Kabell (1981)
Mathematica Scandinavica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On Complete Graphs and Complete Stars Contained as Subgraphs in Graphs.”
The crossing numbers of some generalized Petersen graphs.
On a certain homomorphism properties of graphs II.
Ivan Tafteberg Jakobsen (1983)
Mathematica Scandinavica
Similarity:
On Arbitrarily Traceable Graphs.
Gabriel Dirac (1972)
Mathematica Scandinavica
Similarity:
On Certain Homomorphism Properties of Graphs I.
Ivan Tafteberg Jakobsen (1972)
Mathematica Scandinavica
Similarity:
On longest paths and circuits in graphs.
Tudor Zamfirescu (1976)
Mathematica Scandinavica
Similarity:
On edge-colorings of graphs.
Lars Dovling Andersen (1977)
Mathematica Scandinavica
Similarity:
A note on intersecting graphs.
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
'3in1' enhanced: three squared ways to '3in1' GRAPHS
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
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: