Eulerian and Hamiltonian Graphs

Casual Mode - Take your time!

1 / 15
✓
Correct
0
✗
Incorrect
0
★
Score
0%
Multiple Choice

In a connected graph, an Eulerian path is a path that:

  1. Visits every vertex exactly once
  2. Visits every edge exactly once
  3. Visits every vertex at least once
  4. Visits every edge at least once
Change Mode