620-352 Graph Theory

Any two 200-level subjects from the Department of Mathematics and Statistics. Computer Science 433-253 may be substituted for one of these subjects.

This subject introduces the basic concepts of graph theory including isomorphic graphs, subgraphs, connectedness, bipartite graphs, paths and cycles, trees, weighted graphs and distance in graphs, Steiner trees, matchings, flows and eulerian circuits. Students should develop the ability to implement algorithms on graphs for finding objects such as minimum spanning trees, maximum matchings and flows; and to implement approximation algorithms. Students should also develop the ability to prove simple results in graph theory. This subject demonstrates the variety of applications of graph theory within and outside mathematics.

Introduction to graph theory topics include the concepts listed above, but may also include colouring properties, combinatorics, and the probabilistic method.

Up to 24 pages of written assignments due during semester (0% or 10%); a 3-hour written examination in the examination period (90% or 100%). The relative weighting of the examination and the total assignment mark will be chosen so as to maximise the student's final mark.