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

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 3805 or MATH 3106 or MATH 3158 or permission of the School.Lectures three hours a week.


There are no comments for this course.