I learned that
A connected graph has an Eulerian path if and only if it has at most two vertices of odd degree.
However, because of the term "at most", I'm very confused. What if a graph has $0$ vertices of odd degree, which satisfies "at most". Then does the graph have an Eulerian path?
I thought that a connected graph with $0$ vertices of odd degree has a Eulerian circuit.
$\endgroup$ 3Does "Eulerian path" include "Eulerian circuit"? Aren't the definitions of path and circuit definitely differently?
1 Answer
$\begingroup$A Euler path goes through every edge once. A Euler circuit goes through every edge once and starts and ends at the same vertex. Therefore, Euler circuits are a subset of Euler paths.
Did some research from Euler Paths and Circuits
$\endgroup$
