The fundamental theorems and algorithms of graph theory. Topics include: connectivity, matchings, graph coloring, planarity, the four-color theorem, extremal problems, network flows, and related algorithms.

Grade determined by weekly homework assignments (50%), and a take home final exam during the last week of the semester (50%).