Graphs, Euler paths, tournaments, factors, spanning trees, applications; graph colourings, planar graphs, Menger's theorem, flows in networks, flow algorithms.
Prerequisites: MATH 2203 or CS 1303 and an additional 3 ch in Mathematics and/or Statistics.
