The issue that should right away spring to head Is that this: if a graph is linked and the degree of each vertex is even, is there an Euler circuit? The answer is Sure. In graph G, length involving v1 and v2 is 2. Because the shortest route Amongst the two paths v1– v4&n