MATC32H3 Graph Theory and Algorithms for its Applications

Graphs, subgraphs, isomorphism, trees, connectivity, Euler and Hamiltonian properties, matchings, vertex and edge colourings, planarity, network flows and strongly regular graphs; applications to such problems as timetabling, personnel assignment, tank form scheduling, traveling salesmen, tournament scheduling, experimental design and finite geometries.

Prerequisite: 

[ MATB24H3 or CSCB36H3] and at least one other B-level course in Mathematics or Computer Science

Breadth Requirements: 
Quantitative Reasoning