| Week | Class Date | Topic | Readings | Notes |
|---|
| 1 |
20 May |
Introduction to Graphs, Definitions |
West ch. 1.1 |
Notes 1 |
Intro Slides |
Intro code |
Test Graph
|
|
21 May |
Isomorphism, Induction, Walks, Connectivity |
West ch. 1.1-1.2 |
Notes 2 |
Traversal |
Transport Graph
|
|
23 May |
Eulerian Circuits, Graphic Sequences, Digraphs |
West ch. 1.3 |
Notes 3 |
Vid 1 |
Vid 2
|
|
24 May |
Eulerian Diraphs and PageRank |
West ch. 1.4 |
Notes 4 |
PageRanks |
NFL Graph
|
| 2 |
28 May |
DAGs, Trees |
West ch. 2.1-2.2 |
Notes 5
|
|
29 May |
Tree Algorithms |
West ch. 2.3 |
Notes 6
|
|
30 May |
Matching and Covers |
West ch. 3.1-3.2 |
Notes 7
|
|
31 May |
General Graph Matching |
West ch. 3.3 |
Notes 8
|
| 3 |
3 June |
Vertex and Edge Connectivity |
West ch. 4.1 |
Notes 9
|
|
4 June |
Ear Decompositions, Digraph Connectivity |
West ch. 4.2 |
Notes 10
|
|
6 June |
k-connectivity, Network Flow |
West ch. 4.2-4.3 |
Notes 11
|
|
7 June |
Network Flow |
West ch. 4.3 |
Notes 12
|
| 4 |
10 June |
In-class review |
|
Study Sheet |
Practice Problems |
Solutions
|
|
11 June |
Midterm (308 DCC) |
West ch. 1-4, Lectures 1-12 |
Solutions
|
|
13 June |
Vertex Coloring |
West ch. 5.1 |
Notes 13
|
|
14 June |
More Coloring |
West ch. 5.1-5.2 |
Notes 14 |
Greedy Coloring |
Enron |
GPlus |
US Roads
|
| 5 |
17 June |
Even More Coloring |
West ch. 5.2-5.3 |
Notes 15
|
|
18 June |
Planarity |
West ch. 6.1 |
Notes 16
|
|
20 June |
Kuratowski's Theorem |
West ch. 6.2 |
Notes 17
|
|
21 June |
Coloring of Planar Graphs |
West ch. 6.3 |
Notes 18
|
| 6 |
24 June |
Line Graphs, Edge Coloring |
West ch. 7.1 |
Notes 19
|
|
25 June |
Hamiltonian Graphs |
West ch. 7.2 |
Notes 20
|
|
27 June |
Final Review |
|
Study Sheet |
Practice Problems |
Solutions
|
|
28 June |
Final Exam |
West ch. 1-7, all Lecture Notes |
|