Jun 14, 2025

2025-2026 Undergraduate Catalog

MA 330 Graph Theory and Combinatorics

(4 Credits)
This course is intended for upper level mathematics and computer science majors. Graph theory topics include planar graphs, Euler and Hamilton cycles, graph coloring, and trees with a focus on graph algorithms. Combinatorial topics include arrangements and selections, generating functions, recurrence relations, pigeon-hole principle, and inclusion-exclusion. Students will learn how to identify and prove structural results for graphs and will practice designing algorithms.

Prerequisite: MA225 or MA230 with a grade of B or better