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.
Displaying similar documents to “On Arbitrarily Traceable Graphs.”
The crossing numbers of some generalized Petersen graphs.
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 Complete Graphs and Complete Stars Contained as Subgraphs in Graphs.
G.A. Dirac (1963)
Mathematica Scandinavica
Similarity:
On a certain homomorphism properties of graphs II.
Ivan Tafteberg Jakobsen (1983)
Mathematica Scandinavica
Similarity:
On edge-colorings of graphs.
Lars Dovling Andersen (1977)
Mathematica Scandinavica
Similarity:
On Brooks' theorem and some related results.
H. Tverberg (1983)
Mathematica Scandinavica
Similarity:
4-critical 4-valent planar graphs constructed with crowns.
G. Koester (1990)
Mathematica Scandinavica
Similarity:
On the type III principal graphs of subfactors.
Masaki Izumi (1993)
Mathematica Scandinavica
Similarity:
Infinite locally finite hypohamiltonian graphs.
Monika Schmidt-Steup (1986)
Mathematica Scandinavica
Similarity:
On Principal Graphs and Weak Duality.
V.S. Sunder, Uma Krishnan (1994)
Mathematica Scandinavica
Similarity:
Hamilton circuits with many colours in properly edge-coloured complete graphs.
Lars Dovling Andersen (1989)
Mathematica Scandinavica
Similarity: