An Euler path exists in a connected graph if and only if:
All vertices have even degree
Exactly zero or two vertices have odd degree
All vertices have odd degree
The graph is a tree