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:
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:
A theorem on Hamiltonian line graphs
Ladislav Nebeský (1973)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Isomorphisms and traversability of directed path graphs
Hajo Broersma, Xueliang Li (2002)
Discussiones Mathematicae Graph Theory
Similarity:
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph Pₖ(D) of a digraph D is obtained by representing the directed paths on k vertices of D by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in D form a directed path on k+1 vertices or form a directed cycle on k vertices in D. In this introductory paper several properties of P₃(D) are studied, in particular with respect to isomorphism and traversability....