The concern That ought to right away spring to intellect is this: if a graph is linked and the degree of every vertex is even, is there an Euler circuit? The solution is yes. A circuit must be a closed path, but once again, it could be a shut path if that's the proof being examined. We get