MATH 366 Discrete Methods


3 semester hours

An introduction to graph theory; trees; coloring; Eulerian circuits. Combinatorics; permutations and combinations; recurrence relations.

Prerequisite: 

MATH 248
 .




Print-Friendly Page (opens a new window)