MATH 325 — Combinatorics & Graph Theory
A survey of some of the techniques of combinatorials mathematics and their application. Topics include connectivity, planarity and colorability of graphs, graph isomorphisms, enumeration techniques, recurrence relations, and generating functions. Students must earn a grade of C- or better in all prerequisite courses. The Department of Mathematics & Computer Science reserves the right to remove students from the course who do not meet the course prerequisites.