Nov 23, 2024

2024-2025 Undergraduate Catalog

MA 330 Graph Theory and Combinatorics

(4 Credits)
Graph theory topics include planar graphs, Euler and Hamiltonian circuits, graph coloring, trees, depth-first and breadth-first search, and network algorithms. Combinatorial topics include arrangements and selections, generating functions, recurrence relations, pigeon-hole principle, and inclusion-exclusion. This course covers applications to computer science and business and also material of interest to mathematics/ secondary education majors. MA 330 may be used to satisfy the Computer Science MA 230 requirement.

Prerequisite: MA 203 and MA 225 or permission of the instructor.