
This course covers basic topics in graph theory, including connectivity, Eulerian graphs, planarity, genus, Hamitonicity, isomorphism, chromatic number, Ramsey numbers, and enumeration. These are followed by an introduction to networks with graph algorithms, including algorithms for a maximum matching in a graph and algorithms for maximum flow in a network. 
