/MTH 538. Theory and Applications of Graphs

Catalog description

Basic structural properties of graphs, trees, connectivity, traversability (Eulerian Tours and Hamiltonian Cycles), matchings, and vertex and edge colorings. Classic graph algorithms will also be analyzed, including shortest path, minimum weight tree, optimal assignment, etc. Additional topics are selected from network flows, planarity, extremal problems, and directed graphs as time allows. This is a theory-oriented course, so familiarity with mathematical proof is desirable. Prerequisite: A grade of C- or better in MTH 222 and in MTH 331 , or permission of instructor.