On theH-Force Number of Hamiltonian Graphs and Cycle Extendability

Erhard Hexel

On theH-Force Number of Hamiltonian Graphs and Cycle Extendability

Erhard Hexel

Discussiones Mathematicae Graph Theory (2017)

Volume: 37, Issue: 1, page 79-88
ISSN: 2083-5892

Access Full Article

top

Access to full text

Full (PDF)

Abstract

top

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.

How to cite

top

MLA
BibTeX
RIS

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 -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Language to use for this widget.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Number of notes per page

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.