On theH-Force Number of Hamiltonian Graphs and Cycle Extendability

Erhard Hexel. "On theH-Force Number of Hamiltonian Graphs and Cycle Extendability." Discussiones Mathematicae Graph Theory 37.1 (2017): 79-88. <http://eudml.org/doc/288082>.

@article{ErhardHexel2017,
abstract = {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.},
author = {Erhard Hexel},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {cycle; hamiltonian graph; H-force number; cycle extendability; Hamiltonian graph; -force number},
language = {eng},
number = {1},
pages = {79-88},
title = {On theH-Force Number of Hamiltonian Graphs and Cycle Extendability},
url = {http://eudml.org/doc/288082},
volume = {37},
year = {2017},
}

TY - JOUR
AU - Erhard Hexel
TI - On theH-Force Number of Hamiltonian Graphs and Cycle Extendability
JO - Discussiones Mathematicae Graph Theory
PY - 2017
VL - 37
IS - 1
SP - 79
EP - 88
AB - 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.
LA - eng
KW - cycle; hamiltonian graph; H-force number; cycle extendability; Hamiltonian graph; -force number
UR - http://eudml.org/doc/288082
ER -