3.

4 THE TRAVELING SALESMAN PROBLEM 23

NAME:
For each graph below:

1. Give the degree of each vertex.

2. Put a check if there is a (a ) Hamiltonian path ( b ) Euler trail ( c ) Euler circuit,
or none of these.
3. If there is a Hamiltonian path, write it down (e.g., afcbde).
3.5 THE TRAVELING SALESMAN PROBLEM 23