Study each of the 6 graphs provided.
(a) For each graph, find a Eulerian Path if one exists (i.e., a path for which each [b]edge can be traversed exactly one time[/b]).
(b) Next, find a Hamiltonian Path if one exists (i.e., a path that visits [b]each vertex exactly once[/b]).
(c) What do you notice about Graphs 4 and 5?
(d) What do you notice about Graphs 3 and 6?
