MATH 507 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.