MATH 350 - Graph Theory and Combinatorics. |

Graph models. Graph connectivity, planarity and colouring. Extremal graph theory. Matroids. Enumerative combinatorics and listing.
Prerequisites: MATH 235 or MATH 240 and MATH 251 or MATH 223. Restrictions: Not open to students who have taken or are taking MATH 343 or MATH 340. Intended for students in mathematics or computer science honours programs. 3.000 Credit hours Schedule Types: Lecture, Final Exam, Midterm Exam, Optional Tutorial Faculty of Science Mathematics and Statistics Department Restrictions: May not be enrolled in one of the following Levels: Doctorate Masters & Grad Dips & Certs May not be enrolled in one of the following Faculties: Faculty of Dentistry Faculty of Medicine School of Continuing Studies |

Return to Previous | New Search |