Suppose D, G, E, A, H, C, B, F, D is a Hamilton circuit in a graph. (a) How many vertices does the graph have? Answer

(b) Rewrite the Hamilton circuit using A as the starting/ending vertex: A, Answer, Answer, Answer, Answer, Answer, Answer, Answer, Answer.

(c) Find two different Hamilton paths in the graph that start at A. The first two vertices of each path are written for you:

A, H, Answer, Answer, Answer, Answer, Answer, Answer
A, E, Answer, Answer, Answer, Answer, Answer, Answer