The set of the vertices of the graph $G$ is $V=\{ 0,1,2,3,4,5,6\}$. The vertices i and j are connected with an edge if and only if $|i-j| \mod 3 \in \{0,1 \}$.
Does $G$ have an Euler circuit??
I drawed the graph:

The set of the vertices of the graph $G$ is $V=\{ 0,1,2,3,4,5,6\}$. The vertices i and j are connected with an edge if and only if $|i-j| \mod 3 \in \{0,1 \}$.
Does $G$ have an Euler circuit??
I drawed the graph:

Hint: a connected graph has an Eulerian circuit iff all of its vertices have even degree. What is the degree of vertex 1?