Walks, Eulerian and Hamiltonian Graphs, and the Travelling Salesman Problem

What this note covers

1. Fundamental Terminology: Walks, Trails, Paths, Circuits and Cycles
2. Vertex Degree and Its Role in Eulerian Graphs
3. Eulerian Trails and Circuits: Conditions and Construction
4. Hamiltonian Paths and Cycles
5. The Travelling Salesman Problem: Context and Formulation
6. Nearest-Neighbour Heuristic and Other Inspection Methods
7. Comparing and Evaluating Methods; Exam Technique

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