Introduction to Graph Theory
Hamiltonian and Eulerian properties, matching, trees, connectivity, coloring problems and planarity. Emphasis on algorithms and applications, including optimal network flows. Prerequisite: MATH 42 and MATH 129A (with a grade of "C-" or better in each) or instructor consent.
Normal Grade Rules