Euler's Theorem 1

a. If a graph has any vertex of odd degree then it cannot have an

euler circuit.
b. If a graph is connected and every vertex is of even degree, then
it at least has one euler circuit.

Euler's Theorem 2

a. If a graph has more than two vertices of odd degree then it

cannot have an euler path.
b. If a graph is connected and has just two vertices of odd degree,
then it at least has one euler path. Any such path must start at one of
the odd-vertices and end at the other odd vertex.

For the existence of Eulerian paths it is necessary that no more than two
vertices have an odd degree; this means the Königsberg graph is not
Eulerian. If there are no vertices of odd degree, all Eulerian paths are
circuits. If there are exactly two vertices of odd degree, all Eulerian paths
start at one of them and end at the other. Sometimes a graph that has an
Eulerian path, but not an Eulerian circuit (in other words, it is an open path,
and does not start and end at the same vertex) is called semi-Eulerian.

 A directed graph is Eulerian if it is strongly connected and every

vertex has equal in degree and out degree.