MATH 530 Combinatorial Mathematics I 3.0 Credits
Covers graphs and networks, with an emphasis on algorithms. Includes minimum spanning trees, shortest path problems, connectivity, network flows, matching theory, Eulerian and Hamiltonian tours, graph coloring, and random graphs.
Repeat Status: Not repeatable for credit