Undergraduate Catalog 2018-2019

MTH 337 Applied Combinatorics and Graph Theory(RLA)

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.

Credits

4

Prerequisite

MTH 232

Distribution

N