Characterizing forbidden clawless triples implying Hamiltonian graphs
The authors 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. In addition, the authors present some interesting open problems.
scientific article; zbMATH DE number 1746277