Undergraduate Catalog 2012-2013
MTH 337 Applied Combinatorics and Graph Theory
4 hours; 4 credits
Arrangements selection and counting methods, generating functions, recurrence relations, the principle of inclusion and exclusion, and the pigeonhole principle. Introduction to graph theory, trees and searching, Eulerian and Hamiltonian Circuits, planar graphs and coloring of graphs, applications to optimization problems such as network flows.
Prerequisite: MTH 232
Up one level
Click arrowheads to expand or collapse contents