How does the following graph have an Euler tour and not every node has degree that is even?

The theorem states: A connected graph has an Euler tour if and only if every vertex has even degree.

But this graph has node 'A' with degree = 3.

Graph image.

Graphed using: http://illuminations.nctm.org/

I think I don't fully understand the workings of the theorem of Euler tours.

• What is your definition of "Euler tour"? – bof Jun 25 '16 at 10:04

The theorem says that a connected simple graph has an Euler circuit if and only if each vertex has even degree, and indeed that graph, in which vertices $A$ and $D$ have degree $3$, has no Euler circuit: there is no walk that traverses each edge exactly once and returns to its starting vertex. A companion theorem says that a connected simple graph has an Euler path that is not a circuit if and only if it has exactly two vertices of odd degree, in which case every Euler path begins at one of those two vertices and ends at the other. That's the case for your graph: there are Euler paths, all of which run between $A$ and $D$, but there is no Euler circuit. One such path is $ABDCAFED$, for example.