← Challenges
📅 Daily
easy
euler trail or circuit
Playing as a guest — your score won't be saved. Log in to keep it.
A graph has edges \{v1v2, v1v3, v3v4, v1v5\}. Predict its Eulerian status: type 2 if it has an Euler circuit, 1 if it has an Euler trail but not a circuit, or 0 if it has neither.
Close enough! points.
Not quite.
You predicted — the actual value was .
+ XP