On Vertices Enforcing a Hamiltonian Cycle
Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 1, p. 71.
Voir la notice de l'article dans European Digital Mathematics Library
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.
Classification :
05C10, 05C45
Mots-clés : cycle, hamiltonian, 1-hamiltonian, Hamiltonian, 1-Hamiltonian
Mots-clés : cycle, hamiltonian, 1-hamiltonian, Hamiltonian, 1-Hamiltonian
@article{DMGT_2013__33_1_267730, author = {Igor Fabrici and Erhard Hexel and Stanislav Jendrol{\textquoteright}}, title = {On {Vertices} {Enforcing} a {Hamiltonian} {Cycle}}, journal = {Discussiones Mathematicae Graph Theory}, pages = {71}, publisher = {mathdoc}, volume = {33}, number = {1}, year = {2013}, zbl = {1293.05205}, language = {en}, url = {https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_1_267730/} }
TY - JOUR AU - Igor Fabrici AU - Erhard Hexel AU - Stanislav Jendrol’ TI - On Vertices Enforcing a Hamiltonian Cycle JO - Discussiones Mathematicae Graph Theory PY - 2013 SP - 71 VL - 33 IS - 1 PB - mathdoc UR - https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_1_267730/ LA - en ID - DMGT_2013__33_1_267730 ER -
Igor Fabrici; Erhard Hexel; Stanislav Jendrol’. On Vertices Enforcing a Hamiltonian Cycle. Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 1, p. 71. https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_1_267730/