MATH 179 - Introduction to Graph Theory

3 unit(s)
Hamiltonian and Eulerian properties, matching, trees, connectivity, coloring problems and planarity. Emphasis on algorithms and applications, including optimal network flows.

Prerequisite(s): MATH 42 or MATH 42X, and MATH 39 (each with a grade of “C-” or better). Or instructor consent.
Grading: Letter Graded

Class Schedule | Syllabus Information | University Bookstore