Consider the graph given above. Add an edge so the resulting graph has an Euler circuit (without repeating an existing edge).

Question

Now give an Euler circuit through the graph with this new edge by listing the vertices in the order visited.

lrc.alasu.edu/webwork2_course_files/MAT256/tmp/gif/cjones-3979-setset10prob1image1.png

Answer 1

Sorry, cannot access webwork sites unless registered.

You can use "snip" to copy the screen and post the copy at a photo sharing site such as imageshack.