Course Description

MA338 Graph Theory W 0.5

Selected topics may include graph colouring, extremal graph theory, planar graphs, random graphs, network flows, algebraic methods in graph theory, Ramsay theory for graphs, matching theory, graph algorithms; application of graph theory, such as applications to scheduling, VLSI circuits, compiler design, computer vision and the design of internet search engines.

Prerequisite: MA238.

Official electronic version updated at 10:33 a.m. March 31, 2005

M Watson, Editor Class Timetable