Lower bound for the size of maximal nontraceable graphs.
Frick, Marietjie, Singleton, Joy (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A theorem on Hamiltonian line graphs”
Lower bound for the size of maximal nontraceable graphs.
A note on line graphs
Ladislav Nebeský (1974)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Randomly graphs
Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz (1986)
Mathematica Slovaca
Similarity:
Arbitrarily traceable Eulerian graph has the Hamiltonian square
Milan Sekanina, Anna Sekaninová (1982)
Archivum Mathematicum
Similarity:
Hamiltonicity of -traceable graphs.
Bullock, Frank, Dankelmann, Peter, Frick, Marietjie, Henning, Michael A., Oellermann, Ortrud R., van Aardt, Susan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: