Geodesic
Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs
Discussiones Mathematicae. Graph Theory, Tome 36 (2016) no. 4, pp. 915-929

Voir la notice de l'article provenant de la source Library of Science

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.
Keywords: forbidden subgraph, 1-tough graph, H-free graph, hamiltonian graph 
@article{DMGT_2016_36_4_a11,
     author = {Li, Binlong and Broersma, Hajo J. and Zhang, Shenggui},
     title = {Forbidden {Subgraphs} for {Hamiltonicity} of {1-Tough} {Graphs}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {915--929},
     publisher = {mathdoc},
     volume = {36},
     number = {4},
     year = {2016},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a11/}
}
TY  - JOUR
AU  - Li, Binlong
AU  - Broersma, Hajo J.
AU  - Zhang, Shenggui
TI  - Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2016
SP  - 915
EP  - 929
VL  - 36
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a11/
LA  - en
ID  - DMGT_2016_36_4_a11
ER  - 
%0 Journal Article
%A Li, Binlong
%A Broersma, Hajo J.
%A Zhang, Shenggui
%T Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs
%J Discussiones Mathematicae. Graph Theory
%D 2016
%P 915-929
%V 36
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a11/
%G en
%F DMGT_2016_36_4_a11
Li, Binlong; Broersma, Hajo J.; Zhang, Shenggui. Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs. Discussiones Mathematicae. Graph Theory, Tome 36 (2016) no. 4, pp. 915-929. http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a11/