🕹️ Practice arcade
Extra games, not extra homework — timed sprints, survival runs that end when your lives run out, and mastery drills built from the same skills Graph Theory teaches.
Log in to play — the arcade tracks runs per student.
⚡ Sprints
Beat the clock.
🌐 Graph & Tree Structure Sprint
The Handshaking Theorem, a vertex's own degree, and a tree's edge count -- the arithmetic every graph-theory chapter leans on.
🔄 Euler Circuit Sprint
A connected graph has an Euler circuit only when every vertex has even degree -- check as many as you can.
🌳 Tree Formulas Sprint
Cayley's spanning-tree count, a full binary tree's max node count, or a full m-ary tree's leaf count -- three closed forms, back to back.
💀 Survival
Each miss costs a life — lose them all and the run ends.