Year 12 Mathematics Standard 1 / Networks and Paths

2D Eulerian and Hamiltonian Walks

Eulerian trails/circuits (use every edge once) and Hamiltonian paths/cycles (visit every vertex once), and the odd-degree test for Eulerian routes.