Euler circuits and Euler paths

A walk that uses every edge once exists exactly when the degrees allow it, and the count of odd-degree vertices is the whole of the test.

About 20 minutes6 activities Paper packet