Connected graph has Eulerian circuit iff every vertex has even degree; Eulerian trail iff exactly 0 or 2 odd-degree vertices. Königsberg (Euler 1736).
Connected graph has Eulerian circuit iff every vertex has even degree; Eulerian trail iff exactly 0 or 2 odd-degree vertices. Königsberg (Euler 1736).