A closed walk traversing every edge exactly once. Exists iff the graph is connected and every vertex has even degree (Euler, 1736, Königsberg bridges).
A closed walk traversing every edge exactly once. Exists iff the graph is connected and every vertex has even degree (Euler, 1736, Königsberg bridges).