For each of the graphs 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).

4
Euler circuit
Euler trail
Hamiltonian path
4 4 If there is a
Hamiltonian path, give
one:

abdec
4 4

3 Euler circuit
3 Euler trail
1 Hamiltonian path
If there is a
2
Hamiltonian path, give
one:
1
2
none of these
4

Euler circuit
2 Euler trail
Hamiltonian path
1
If there is a
Hamiltonian path, give
3 3 1
one:
2
none of these