Maximal nontraceable graphs with toughness less than one.
Bullock, Frank, Frick, Marietjie, Singleton, Joy, van Aardt, Susan, Mynhardt, Kieka (C.M.) (2008)
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.
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 “A traceability conjecture for oriented graphs.”
Maximal nontraceable graphs with toughness less than one.
Lower bound for the size of maximal nontraceable graphs.
Frick, Marietjie, Singleton, Joy (2005)
The Electronic Journal of Combinatorics [electronic only]
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:
A sufficient condition for Hamiltonian graphs
Ivan Polický (1995)
Mathematica Slovaca
Similarity:
Randomly graphs
Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz (1986)
Mathematica Slovaca
Similarity:
Notes on sufficient conditions for a graph to be hamiltonian.
Paul, Michael Joseph, Shershin, Carmen Baytan, Shershin, Anthony Connors (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity: