MATH
179 Introduction to Graph Theory
Catalog Description
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.
3 Units
Math 179 Homework and Exam Schedule