Characterizing forbidden clawless triples implying hamiltonian graphs Original Research Article

In this paper we characterize those forbidden triples of graphs, no one of which is a generalized claw, sufficient to imply that a 2-connected graph of sufficiently large order is hamiltonian.