Claw‐free 3‐connected P11‐free graphs are hamiltonian
Tomasz Łuczak, Florian Pfender · Journal of Graph Theory · 2004
Abstract We show that every 3‐connected claw‐free graph which contains no induced copy of P11 is hamiltonian. Since there exist non‐hamiltonian 3‐connected claw‐free graphs without induced copies of P12 this result is, in a way, best possible. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 111–121, 2004