Hamiltonicity and forbidden subgraphs in 4‐connected graphs
Florian Pfender · Journal of Graph Theory · 2005
Abstract Let T be the line graph of the unique tree F on 8 vertices with degree sequence (3,3,3,1,1,1,1,1), i.e., T is a chain of three triangles. We show that every 4‐connected {T, K1,3}‐free graph has a hamiltonian cycle. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 262–272, 2005