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 L such that if a 3-connected graph being claw-free and L-free implies G is hamiltonian-connected, then L is an element of L. (C) 2002 Wiley Periodicals, Inc. [References: 7]
展开▼
