Forbidden subgraphs, stability and hamiltonicity (Q1292819)

The authors study the stability of some classes of claw-free graphs defined in terms of forbidden subgraphs under the closure operation defined in \textit{Z. Ryjáček} [J. Comb. Theory, Ser. B 70, No.~2, 217-224 (1997; Zbl 0872.05032)]. They characterize all connected graphs \(A\) such that the class of all \(CA\)-free graphs (where \(C\) denotes the claw) is stable. Using this result, the authors prove that every 2-connected and \(CHP_8\)-free, \(CHZ_5\)-free or \(CHN_{1,1,4}\)-free graph is either hamiltonian or belongs to some classes of exceptional graphs having connectivity 2.