MATH 5P35 - Graph Theory

Basic definitions, paths and cycles, connectivity, trees and forests, bipartite graphs, Eulerian graphs; Matchings in bipartite graphs and in general graphs; Planar graphs, Euler’s formula and Kuratowski’s theorem. Graph colourings, Brooks’ and Vizing’s theorem and colouring of planar graphs; Network flows, Min-Max Theorem.