Thread: What is the name of this theorem proved by Euler?

Euler proved that a graph has an Eulerian path if, and only if, at most two vertices have odd order. What is the name of this theorem? Can you please link me to a proof of this theorem?

Thanks

Originally Posted by feyomi

Euler proved that a graph has an Eulerian path if, and only if, at most two vertices have odd order. What is the name of this theorem? Can you please link me to a proof of this theorem?

I am unaware of any universal accepted name given to that theorem. That is not to say that some authors have not given it a name.
We might call it the Eulerian path theorem.