Graph Theory

4.0 credits

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.