On the square of a Hamiltonian cycle in dense graphs

In 1962 Posa conjectured that any graph G of order n and minimum degree at least ⅔ n contains the square of a Hamiltonian cycle. In this paper we prove this conjecture for sufficiently large n. © 1996 John Wiley & Sons, Inc.