Instructor: GaYee Park
Course on canvas.dartmouth.edu ⇗
Syllabus
| Date | Textbook (D.B. West) | Extra |
| T. 03/31 | What is graph? p. 1-6 | |
| Th. 04/02 | Isomorphisms and classes of graphs p. 6-14 | |
| T. 04/07 | Path, cycles, Trails & Eulerian p.19-26 | |
| Th. 04/09 | Eulerian & Vertex degrees p. 26 -29, 34-38 | |
|
T. 04/14 |
Extremal, Graphic Sequence & Digraphs | |
| Th. 04/16 | Basic Properties of trees (p. 67 - 72) | |
| T. 04/21 | Spanning Trees and Enumeration (p.81 - 86) | |
| Th. 04/23 | Optimization and Trees (p. 95 - 99) | |
| T. 04/28 | Decomposition and Graceful Labeling (p. 87) & Intro to Matching (p. 107) | |
| Th. 04/30 | Midterm 1 | |
| T. 05/05 | Matching in Bipartite graph and optimization p. 107 - 115 | |
| Th. 05/07 | Matching algorithms & connectivity p. 123, p. 130, p.149-153 | |
| T. 05/11 | edge connectivity (p. 152)& k-Connected graphs (p. 161) + Menger's Theorem | |
| Th. 05/13 | Network Flow Problems (p. 176) |