MATH 407 Graph Theory

Directed and undirected graphs, trees, connectivity; cut edges, cut vertices, and blocks; Eulerian and Hamiltonian graphs; planarity coloring problems; graph-theoretic algorithms and applications.

Credits

3

Prerequisite

MATH 248 (formerly MATH 305) or CSC 210