Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: 1-hamiltonian

Sortuj według:

Ogranicz wyniki do:

On Vertices Enforcing a Hamiltonian Cycle

100%

Fabrici I., Hexel E., Jendrol’ S.

Discussiones Mathematicae Graph Theory

2013

tom 33

nr 1

71-89

A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian. The H-force number 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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Fabrici I.

1 Hexel E.

1 Jendrol’ S.

1 2013

Wyniki wyszukiwania

On Vertices Enforcing a Hamiltonian Cycle