MAT 330 Graph Theory and Combinatorics

This course will introduce students to the foundational ideas in the areas of graph theory and combinatorics. Topics include graph distance, trees, Euler and Hamiltonian trails, planar graphs, graph coloring, binomial coefficients, the pigeonhole principle, inclusion-exclusion, and generating functions. Prerequisite: MAT 260 and MAT 280 both with a grade of 2 or higher, or permission of the instructor.

3 credit hours