Question: Make sure you understand Theorem by doing these problems.
Theorem: (1) A connected graph G has an Euler circuit ⇐⇒ every vertex of G has even degree.
(2) A connected graph G has an Euler traversal but not an Euler circuit ⇐⇒ G has exactly two vertices of odd degree. Does the graph in Figure have an Euler traversal, an Euler circuit?
