This course provides an introduction to the basic theorems and algorithms of graph theory. Topics include graph isomorphism, connectedness, Euler tours, Hamiltonian cycles, and matrix representation. Further topics may include spanning trees, coloring algorithms, planarity algorithms, and search algorithms. Applications may include network flows, graphical enumeration, and embedding of graphs in surfaces.
Prerequisites
MAT 250, MAT 258