Generalizations of Dirac’s theorem in Hamiltonian graph theory—A survey

Dirac showed in 1952 that every graph of order n is Hamiltonian if any vertex is of degree at least n 2 . This result has played an important role in extremal Hamiltonian graph theory. This paper is a survey on some recent results on generalization of Dirac’s theorem.