Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs (Q1348122): Difference between revisions

A graph containing no induced subgraph isomorphic to \(K_{1,3}\) is said to be claw-free. This paper has been inspired by a result of \textit{M.~Li} [J. Graph Theory 17, 303-313 (1993; Zbl 0778.05056)] saying that any 3-connected claw-free graph of order \(n\) and minimum degree at least \((n+5)/5\) is Hamiltonian. The authors prove that the theorem holds even if the claw-free condition is replaced by the weaker assumption that \(G\) does not contain any induced subgraph isomorphic to \(K_{1,4}\) or \(K_{1,4}+e\), provided \(n\geq 30\).