On Arbitrarily Traceable Graphs.
Gabriel Dirac (1972)
Mathematica Scandinavica
Similarity:
Displaying similar documents to “On edge-colorings of graphs.”
On Arbitrarily Traceable Graphs.
The crossing numbers of some generalized Petersen graphs.
F. Harary, G. Exoo, J. Kabell (1981)
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:
Hamilton circuits with many colours in properly edge-coloured complete graphs.
Lars Dovling Andersen (1989)
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 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 the Graphs which are the Edge of a Plane Tiling.
R. Ayala, E. Dominguez, A. Márquez (1995)
Mathematica Scandinavica
Similarity:
Shadows of colored complexes.
P. Frankl, G. Kalai, Z. Füredi (1988)
Mathematica Scandinavica
Similarity: