Note: If this course is being taught this semester, more information can be found at the course home page.
Paths, trees, circuits. Bipartite graphs, matching problems, flow problems, coloring problems. Connectivity and Menger’s theorem. Independent paths and sets. Planar graphs and Kuratowski’s theorem.