MA338
Graph Theory
0.5 Credit

Hours per week:
  • Lecture/Discussion: 3

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.

Additional Course Information
Prerequisites
MA238.