Forbidden Subgraphs that Imply Hamiltonian-Connectedness

摘要

It is proven that if G is a 3-connected claw-free graph which is also Z3-free211u001e(where Z3 is a triangle with a path of length 3 attached), P6-free (where P6 is a 211u001epath with 6 vertices) or H1-free (where H1 consists of two disjoint triangles 211u001econnected by an edge), then G is hamiltonian-connected.