MATH 367 Discrete Methods

4 semester hours

An introduction to graph theory; trees; coloring; Eulerian circuits. Combinatorics; permutations and combinations; recurrence relations; algorithmic approaches to combinatorics problems; implementation of algorithms in graph theory and combinatorics.

Prerequisites: MATH 249 and (MATH 181 or CMSI 1010 or ENGR 160).

Close Window