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

Printable View

- Oct 10th 2011, 01:19 PMfeyomiWhat 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 - Oct 10th 2011, 01:31 PMPlatoRe: What is the name of this theorem proved by Euler?