The Hidden Algorithm of Oreʹs Theorem on Hamiltonian Cycles

In 1960, Ore found a simple sufficient condition for a graph to have a Hamiltonian cycle. We expose a heuristic algorithm, hidden in Oreʹs proof, which can be very effective in actually finding such a cycle. This algorithm is always reasonably efficient and suggests an easy proof that almost all graphs are Hamiltonian.