Print and PDF Options

MATH 4808 [0.5 credit] Graph Theory and Algorithms (Honours)

Paths, circuits, Eulerian and Hamiltonian graphs, connectivity, colouring problems, matching, Ramsey theory, network flows.
Prerequisite(s): MATH 3106 or MATH 3158 or MATH 3855 or permission of the School.
Lectures three hours a week.