Eulerian path in a finite graph

Let $G=(V,E)$ be a finite connected graph. Define an eulerian path as a sequence of edges from $E$ that connects all vertices of $V$.

What condition on $G$ ensures the existence of an eulerian path ?