
## Section2.3Hamiltonian cycles

We now introduce the concept of Hamiltonian walks. Though on the surface the question seems very similar to determining whether or not a graph is Eulerian, it turns out to be much more difficult.

###### Definition2.3.1

A graph is Hamiltonian if it has a closed walk that uses every vertex exactly once; such a path is called a Hamiltonian cycle

First, some very basic examples:

1. The cycle graph $C_n$ is Hamiltonian.
2. Any graph obtained from $C_n$ by adding edges is Hamiltonian
3. The path graph $P_n$ is not Hamiltonian.

The term Hamiltonian comes from William Hamiltonian, who invented (a not very successful) board game he termed the "icosian game", which was about finding Hamiltonian cycles on the dodecahedron graph (and possibly its subgraphs)