Hamiltonian graphs with prescribed minimum degree and no near-spanning cycles

Xingzhi Zhan

In 1984, Roland Häggkvist posed the problem of constructing Hamiltonian graphs of order $n$ with large minimum degree and no $(n-2)$-cycle. He remarked that he did not know of such…