On vertices enforcing a Hamiltonian cycle

Fabrici, Igor; Hexel, Erhard; Jendrol', Stanislav GND

A nonempty vertex set X ⊆ V(G) of a hamiltonian graph G is called an of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian. The h(G) of a graph G is defined to be the smallest cardinality of an H-force set of G. In the paper the study of this parameter is introduced and its value or a lower bound for outerplanar graphs, planar graphs, k-connected graphs and prisms over graphs is determined.

Cite

Citation style:

Fabrici, Igor / Hexel, Erhard / Jendrol', Stanislav: On vertices enforcing a Hamiltonian cycle. 2013.

Access Statistic

Total:
Downloads:
Abtractviews:
Last 12 Month:
Downloads:
Abtractviews:

open graphic

Rights

Use and reproduction:

Export