Euler-path condition: an Euler path (cross every arc exactly once) exists only if the graph has exactly how many odd-degree nodes?

Answer

zero or two

An odd-degree node can only be a start or end of the walk; with more than two such nodes (Königsberg has four) no single Euler path is possible.