The Hamiltonian reference article from the English Wikipedia on 24-Apr-2004
(provided by Fixed Reference: snapshots of Wikipedia from wikipedia.org)

Hamiltonian

For people who check facts
In physics, the Hamiltonian has two distinct but closely related meanings.


In graph theory, a graph is Hamiltonian if it contains a path that starts and ends at the same vertex and includes each vertex exactly once. Such a path is called a Hamiltonian cycle.


Both the Hamiltonian operator in physics and Hamiltonian cycles in graph theory are named after Sir William Rowan Hamilton.
This is a disambiguation page; that is, one that points to other pages that might otherwise have the same name. If you followed a link here, you might want to go back and fix that link to point to the appropriate specific page.