Hamiltonian paths on Platonic graphs.
Hopkins, Brian (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Hopkins, Brian (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
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.
Blain, Paul, Bowlin, Garry, Foisy, Joel, Hendricks, Jacob, LaCombe, Jason (2007)
The New York Journal of Mathematics [electronic only]
Similarity:
Jan Kratochvíl, Dainis A. Zeps (1987)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
McKee, Terry A. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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.
Cai, Maocheng, Li, Yanjun (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A. Benkouar, Y. Manoussakis, V. Th. Paschos, R. Saad (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Enomoto, Hikoe, Katona, Gyula O.H. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity: