Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: H-free graph

Sortuj według:

Ogranicz wyniki do:

Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs

100%

Li B., Broersma H. J., Zhang S.

Discussiones Mathematicae Graph Theory

2016

tom 36

nr 4

915-929

A graph G is said to be 1-tough if for every vertex cut S of G, the number of components of G − S does not exceed |S|. Being 1-tough is an obvious necessary condition for a graph to be hamiltonian, but it is not sufficient in general. We study the problem of characterizing all graphs H such that every 1-tough H-free graph is hamiltonian. We almost obtain a complete solution to this problem, leaving H = K1 ∪ P4 as the only open case.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Broersma H. J.

1 Li B.

1 Zhang S.

1 2016

Wyniki wyszukiwania

Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs