Slides
This page contains links to slides from lectures when they were used, as well as telegraphic summaries of what was covered.
- Lecture 1 Slides Introduction, Degree and Handshaking
- Lecture 2 Slides Instant Insanity and basic definitions
- Lecture 3 Slides Covering bipartite graphs from last session, covering isomorphisms
- Lecture 4 Slides Isomorphisms example, trees and applications to chemistry
- Lecture 5 Slides Chemistry, Eulerian Graphs
- Lecture 6 Slides Hamiltonian Graphs
- Lecture 7 Slides Prufer code
- Lecture 8 Slides Kruskal and Prim’s algorithms
- Lecture 9 Slides Shortest and Longest paths
- Lecture 10 Slides Traveling Salesperson Problem
- Lecture 11 Slides Introduction to Planar Graphs
- Lecture 12 Slides Planarity Algorithm for Hamiltonian Graphs and Kuratowski’s Theorem
- Lecture 13 Slides Graphs on other surfaces
- Lecture 14 Slides Euler’s Theorem and Applications
- Lecture 15 Slides Chromatic Number
- Lecture 16 Slides Six colour theorem and Chromatic Index
- Lecture 17+18 Slides Fininishing Chromatic Index, Starting Chromatic Polynomial, Deletion-Contraction