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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Maximal nontraceable graphs with toughness less than one.”
Lower bound for the size of maximal nontraceable graphs.
A sufficient condition for Hamiltonian graphs
Ivan Polický (1995)
Mathematica Slovaca
Similarity:
A traceability conjecture for oriented graphs.
Frick, Marietjie, van Aardt, Susan A., Dunbar, Jean E., Nielsen, Morten H., Oellermann, Ortrud R. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Vertices Enforcing a Hamiltonian Cycle
Igor Fabrici, Erhard Hexel, Stanislav Jendrol’ (2013)
Discussiones Mathematicae Graph Theory
Similarity:
A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian. The H-force number h(G) of a graph G is defined to be the smallest cardinality of an H-force set of G. In the paper the study of this parameter is introduced and its value or a lower bound for outerplanar graphs, planar graphs, k-connected graphs and prisms over graphs is determined.
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:
On open Hamiltonian walks in graphs
Pavel Vacek (1991)
Archivum Mathematicum
Similarity:
Uniquely Hamiltonian characterizations of distance-hereditary and parity graphs.
McKee, Terry A. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: