Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

Euler's theorem (Eulerian graphs)

A connected graph has an Euler circuit exactly when every vertex has an even number of edges touching it.

A connected graph $G$ has an Euler circuit if and only if every vertex of $G$ has even degree (theorem: eulers-theorem-eulerian-graphs).