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. [0.5 credits]
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. [0.5 credits]
