Operations Research or Statistics
This is the first part of a full-semester course on algorithmic graph theory. We review the basic concepts and central results of graph theory. Representations of graphs. Subgraphs, paths, cycles. Connectivity. Bipartite graphs. Trees. Euler tours and Hamilton cycles. Independent sets and cliques. Graph coloring. Planarity. Packing and covering. Perfect graphs. Chordal graphs.
Lecture: 100min/wk and Recitation: 50min/wk