On theH-Force Number of Hamiltonian Graphs and Cycle Extendability

• Autorzy: Erhard Hexel
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

cycle; hamiltonian graph; H-force number; cycle extendability

Kategorie tematyczne

• 05C45: Eulerian and Hamiltonian graphs

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 1
• Strony: 79-88

Daty

wydano

2017-02-01

otrzymano

2015-07-27

poprawiono

2016-02-23

zaakceptowano

2016-02-23

online

2017-01-13

Twórcy

autor

Erhard Hexel

• Department of Mathematics, Technische Universität Ilmenau, Postfach 0565, D-98684 Ilmenau,

Identyfikatory

DOI

10.7151/dmgt.1923