On the Burkard-Hammer condition for Hamiltonian split graphs (Q2484370)

A graph \(G=(V,E)\) is called split graph if \(V\) splits into an independent set \(I\) and a clique \(C\). \textit{R. E. Burkard} and \textit{P. L. Hammer} [J.~Comb.\ Theory, Ser.~B 28, 245--248 (1980; Zbl 0403.05058)] gave a necessary condition for split graphs with \(| I| < | C| \) to be Hamiltonian. This condition is sufficient if \(\delta(G) \geq | I| -3\) and \(5 \neq | I| <| C| \). The case \(| I| =5\) is also settled.