MATH 165 - DISCRETE MATHEMATICS II

Hours: 3
Graph theory including planarity, isomorphism, covering circuits, coloring, trees and searching, network algorithms; combinatorics including counting, permutations, combinations, binomial coefficients, recurrence relations, the pigeonhole principle, and the inclusion-exclusion principle.
Prerequisites: MATH 155.