On the H-Force Number of Hamiltonian Graphs and Cycle Extendability
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 cycl...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2017-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1923 |