MATH 370 - Graph Theory and Combinatorics

Credits: 4
A study of finite graphs and combinatorics, covering enumeration of combinatorial structures, directed and undirected graphs, and recursive algorithms. Topics include trees, planarity, graph coloring, Eulerian and Hamiltonian graphs, shortest path algorithms, the pigeonhole principle, permutations and combinations of finite sets and multisets, binomial and multinomial coefficients, and the inclusion-exclusion principle.

 

Prerequisite: MATH 205  with a grade of C or better.

Distribution Requirements: SP.

This is one of the mathematics courses that may be substituted for one of the required 300-level CMPSC courses in the Computer Science major.