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...
Spremljeno u:
| Glavni autor: | |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
University of Zielona Góra
2017-02-01
|
| Serija: | Discussiones Mathematicae Graph Theory |
| Teme: | |
| Online pristup: | https://doi.org/10.7151/dmgt.1923 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|