This activity is also part of one or more other Books. Modifications will be visible in all these Books. Do you want to modify the original activity or create your own copy for this Book instead?
This activity was created by '{$1}'. Do you want to modify the original activity or create your own copy instead?
This activity was created by '{$1}' and you lack the permission to edit it. Do you want to create your own copy instead and add it to the book?
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?