MATH 4808
Graph Theory and Algorithms (Honours)
Paths, circuits, Eulerian and Hamiltonian graphs, connectivity, colouring problems, matching, Ramsey theory, network flows.
Prerequisites & course information
Prerequisite(s): MATH 3106 or MATH 3158 or MATH 3855 or permission of the School. Lectures three hours a week.
Sources
- Course catalogue ↗2026–2027
- MATH 4808A W22 ↗2021