- Graphs, Semi-Eulerian, Eulerian, Valency of nodes etc.
- Route inpection algorithm
- Identifying odd vertices, possible pairings, identifying shortest route
- Starting / finishing at same point
- Starting / finishing at different points
- Example of exam question using route inspection
https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpOTY1MTQ1NjAtNWU2NS00NmYwLTlhZGEtMDkwN2FlNWZmOGVi&hl=en