Hamilton Cycles

A cycle that contains all vertices of a graphG is called a hamilton cycle (or hamiltonian cycle).G is hamiltonian if it contains a hamilton cycle. For example, Figure 11.1 shows a hamilton cycle in the graph called the truncated tetrahedron. It is easy to see

that the graph of the cube is also hamiltonian (see Chapter 1).