MATH40103

Prerequisites: Math 30224 with a C- or better.Graphs, directed graphs and their representations, weighted graphs, shortest path, Hamiltonian and Eulerian circuits, spanning trees, matching connectedness, flows, Euler's formula, planarity, duality, polyhedra coloring theorems with applications to map coloring and scheduling problems. Ramsey theory, enumeration and random walks, if time allows..