A Hamilton path in a graph is a path that includes each vertex of the graph once and only once. ! ■ !A Hamilton circuit is a circuit that includes each vertex of the graph once and only once. (At the end, of course, the circuit must return to the starting vertex.) !