A Euler tour is defined like that:
Let $G = (V, E)$ be a graph and $C$ a circuit in $G$.
$C$ is called Euler tour $\Leftrightarrow$ every edge $e \in E$ is exactly once in the circuit.
If a graph $G$ has at least one Euler tour $C$ that starts with $v \in V$, can $G$ have another Euler tour that also starts with $v$ and does not simply go into the other direction?