1. Which of the following best describes a HAMILTONIAN PATH.
A. A path that uses each VERTEX of a graph exactly once and ends at a vertex different from the starting vertex.
B. A path that uses each EDGE of a graph exactly once and ends at the starting vertex.
C. A path that uses each VERTEX of a graph exactly once and ends at the starting vertex.

2. Which of the below descriptions shows a possible HAMILTON PATH?
FEBCBAD <

3. Which of the following best describes a Hamiltonian Circuit.
A path that uses each VERTEX of a graph exactly once and ends at the starting vertex. <

4. Which of the following is a Hamiltonian Circuit, beginning at vertex A, for the given graph?
A. ABCDA
B. ACBDA
C. ADBCA