Walks, trails, paths, cycles, shortest paths, Eulerian and Hamiltonian graphs

What this note covers

1. The four levels of movement through a graph
2. Naming and testing routes in an exam
3. Eulerian and semi-Eulerian: covering every edge
4. Hamiltonian and semi-Hamiltonian: visiting every vertex
5. Shortest paths in a weighted graph
6. Telling the four problems apart under pressure
7. How route and traversal questions are examined and what separates a top answer

7 sections · 12 key terms & formulas · 6 common mistakes