A Closure Lemma for tough graphs and Hamiltonian degree conditions

Chinh T. Hoang, Cleophee Robin

The closure of a graph $G$ is the graph $G^{\ast }$ obtained from $G$ by repeatedly adding edges between pairs of non-adjacent vertices whose degree sum is at least $n$, where $n$ is the…