CO 342 Introduction to Graph Theory
Combinatorics and Optimization (2009-2010)

An introduction to some of the key parts of graph theory: connectivity, planarity and matchings. Connectivity: Menger's Theorem, 3-connected graphs and contractible edges, Kuratowski's Theorem, uniqueness of planar embeddings. Planarity, cycle and co-cycle spaces: peripheral cycles and the cycle space of a 3-connected graph. Matchings: Review of Konig's Theorem, Tutte's Theorem. [Offered: F,S]
Prerequisites: MATH 239 or 249; Not open to General Mathematics students

Sections For Fall 2009

Lectures
ProfessorTimeCapacitySecAssocLocationCode
Van Zwam, Stefan 11:30-12:20 M T W Th F 46/85 1 1 MC 2054 4768

Sections For Spring 2009

Lectures
ProfessorTimeCapacitySecAssocLocationCode
Haxell, Penny E. 09:30-10:20 M T W Th F 43/80 1 1 MC 2035 3138

Professors That Have Taught CO 342