Hamiltonian paths on Platonic graphs.
Hopkins, Brian (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “On Vertices Enforcing a Hamiltonian Cycle”
Hamiltonian paths on Platonic graphs.
On Hamiltonian cycles in two-triangle graphs
Jan Kratochvíl, Dainis A. Zeps (1987)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Uniquely Hamiltonian characterizations of distance-hereditary and parity graphs.
McKee, Terry A. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On theH-Force Number of Hamiltonian Graphs and Cycle Extendability
Erhard Hexel (2017)
Discussiones Mathematicae Graph Theory
Similarity:
The H-force number h(G) of a hamiltonian graph G is the smallest cardinality of a set A ⊆ V (G) such that each cycle containing all vertices of A is hamiltonian. In this paper a lower and an upper bound of h(G) is given. Such graphs, for which h(G) assumes the lower bound are characterized by a cycle extendability property. The H-force number of hamiltonian graphs which are exactly 2-connected can be calculated by a decomposition formula.
A sufficient condition for Hamiltonian graphs
Ivan Polický (1995)
Mathematica Slovaca
Similarity:
Generating hamiltionian cycles in complete graphs.
Fleischner, H., Horák, P., Širáň, J. (1993)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
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:
A -factor containing a given Hamiltonian cycle.
Cai, Maocheng, Li, Yanjun (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity: