Articles by others on the same topic
Pósa's theorem gives a sufficient degree-sequence condition for a Hamiltonian cycle in a finite simple graph. Longest-path rotation is a technique used in proving Hamiltonicity results; it is not itself the degree-sequence theorem.