Characterizing forbidden clawless triples implying hamiltonian graphs

R.J. Faudree, R.J. Gould, M.S. Jacobson, L.L. Lesniak
2002 Discrete Mathematics  
In this paper we characterize those forbidden triples of graphs, no one of which is a generalized claw, su cient to imply that a 2-connected graph of su ciently large order is hamiltonian.
doi:10.1016/s0012-365x(01)00235-7 fatcat:uj35yqks2rdzjemwb3afkvytui