Students will solve problems using concepts in graph theory including directed and undirected graphs, the Handshaking Theorem, isomorphism, paths, connectedness, and Euler and Hamilton Paths.
Students will explore counting principles such as: recurrence relations, Polyas Enumeration Theorem, inclusion-exclusion, and the Pigeonhole principle.