1097-0118/asset/JGT_left.gif?v=1&s=1444a0be416c8f041967dd96201bc2e34f807002)
Claw-free 3-connected P11-free graphs are hamiltonian
Article first published online: 22 JUN 2004
DOI: 10.1002/jgt.20019
Copyright © 2004 Wiley Periodicals, Inc.
1097-0118/asset/cover.gif?v=1&s=747ee645df081de59c78864878c8bdb9daeca9a1 "Journal of Graph Theory")
Additional Information
How to Cite
Łuczak, T. and Pfender, F. (2004), Claw-free 3-connected P11-free graphs are hamiltonian. Journal of Graph Theory, 47: 111–121. doi: 10.1002/jgt.20019
Publication History
- Issue published online: 1 JUL 2004
- Article first published online: 22 JUN 2004
- Manuscript Revised: 22 AUG 2003
- Manuscript Received: 22 OCT 2001
- Abstract
- References
- Cited By
Keywords:
- Hamilton cycle;
- claw-free graphs;
- forbidden subgraphs
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