If a graph is an Euler Path, that mean it has also can be travered and has only two odd verticies,  For a Euler path you start and stop on different odd nodes.

 
 

Vertex	Degree	Even / Odd
A	3	Odd
C	3	Odd

 

This network is an Euler path because it has only two odd nodes.

Euler summarized his findings about circuits and paths into 2 theorems, lets take a look!!!