MATH 273 - Combinatorial Graph Theory

Paths and trees, connectivity, Eulerian and Hamiltonian cycles, matchings, edge and vertex colorings, planar graphs, Euler's formula and the Four Color Theorem, networks. Prerequisite: 52 or 54 or instructor's permission.

Credits: 3