11. The graph below has a possible path E-B-A-C-B-D-C-E. Trace this path with your pencil and determine
whether it is an Euler circuit. (2 points)
C
E
D
A
A
B
12. True or False: When using Fleury's algorithm to find an Euler circuit, always begin with an even
vertex. (2 points)
13. Determine whether the graph has an Euler path, Euler circuit, or neither. If the graph has an Euler
path or circuit, use Fleury's algorithm to find one. (3 points)
B
C
D
A) Euler path; A, B, C, F, A, C, D, E, C, G, E, C, A
B) Euler circuit; A, B, C, D, E, G, C, F, A
C) neither
E
14.3 Hamilton Paths and Hamilton Circuits
14. True or False: A Hamilton path must contain every edge in the graph exactly once. (2 points)
15. True or False: A Hamilton circuit must begin and end at the same edge. (2 points)
