Forbidden subgraphs that imply hamiltonian-connectedness

✍ Scribed by Hajo Broersma; Ralph J. Faudree; Andreas Huck; Huib Trommel; Henk Jan Veldman

• Book ID: 102341535
• Publisher: John Wiley and Sons
• Year: 2002
• Tongue: English
• Weight: 172 KB
• Volume: 40
• Category: Article
• ISSN: 0364-9024
• DOI: 10.1002/jgt.10034

✦ Synopsis

Abstract

It is proven that if G is a 3‐connected claw‐free graph which is also H~1~‐free (where H~1~ consists of two disjoint triangles connected by an edge), then G is hamiltonian‐connected. Also, examples will be described that determine a finite family of graphs ${\cal L}$ such that if a 3‐connected graph being claw‐free and L‐free implies G is hamiltonian‐connected, then L $\in \cal L$. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 104–119, 2002