Date  Content of the lecture  Lecture notes  Diestel's book

Tue 5.9.
 Introduction to graph theory (see PDF slides from the first lecture)
 N/A  N/A

Thu 7.9.
 Adjacency & incidence matrices, vertexdegree, walks, trails & paths
 Chapters 1 & 2  Chapter 1

Tue 12.9.
 Connected components, subgraphs and induced subgraphs, cutvetices and cutedges  Chapter 2  Chapter 1

Thu 14.9.
 Trees – various characterisations and their mutual equivalence  Chapter 3  Chapter 1

Tue 19.9.
 Number of graphs on n vertices and labelled trees on n vertices (Cayley's formula)  PDF notes  N/A

Thu 21.9.
 Spanning trees, fundamental cycles, Minimum spanning trees and Kruskal's algorithm  Chapter 4  N/A

Tue 26.9.
 Plan: Shortest paths and Dijkstra's algorithm  Chapter 5  N/A
