Remarks on Hamiltonian properties of squares of graphs

Günter Schaar

Displaying similar documents to “Remarks on Hamiltonian properties of squares of graphs”

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:

On $k$ -path hamiltonian graphs and line-graphs

Tudor Zamfirescu (1971)

Rendiconti del Seminario Matematico della Università di Padova

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.