| Article ID: | iaor19982929 |
| Country: | United Kingdom |
| Volume: | 34 |
| Issue: | 11 |
| Start Page Number: | 113 |
| End Page Number: | 119 |
| Publication Date: | Dec 1997 |
| Journal: | Computers & Mathematics with Applications |
| Authors: | Palmer E.M. |
| Keywords: | probability |
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.