MAT 330 Graph Theory and Combinatorics

Spring Odd-Numbered Years

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 235 with a grade of 2.0 or higher.

3 credit hours