Abstract :
In this paper we characterize all triples of connected graphs C,X,Y (where C is a claw) and such that every 2-connected CXY-free graph G is hamiltonian. This result together with a previous result by Faudree, Gould, Jacobson, and Lesniak give a full characterization of triples of forbidden subgraphs implying hamiltonicity of 2-connected graphs.
