| Week 1 | Class Topic | Homework From |
| 9/4 | Introduction & Basic Definitions | HW1 (Solutions) |
| Week 2 |
| 9/8 | Regular Graphs | |
| 9/11 | Degree Sequences | HW2(Solutions) |
| Week 3 |
| 9/15 | Graph Isomorphisms | |
| 9/18 | Connected Graphs | HW3(Solutions) |
| Week 4 |
| 9/22 | Trees | |
| 9/25 | More Trees | HW4(Solutions) |
| Week 5 |
| 9/29 | Enumeration of Trees: Cayley and Prüfer | |
| 10/2 | Minimum Spanning Tree Algorithms | HW5 (Solutions) |
| Week 6 |
| 10/6 | Minimum Distance Problem: Dijkstra | Practice Problems (Solutions) |
| 10/9 | Connectivity:Bridges & Cut-Vertices |
| Week 7 |
| 10/13 | Exam #1 | (Solutions) |
| 10/16 | Bridges & Cut-Vertices (Con't) | HW6 (Solutions) |
| Week 8 |
| 10/20 | Connectivity: Vertex and Edge Cuts | |
| 10/23 | Connectivity | HW7 (Solutions) |
| Week 9 |
| 10/27 | Menger & Whitney | |
| 10/30 | Menger & Whitney (Con't) | HW8 (Solutions) |
| Week 10 |
| 11/3 | Eulerian Graphs | |
| 11/6 | Hamiltonian Graphs | Practice Problems (Solutions) |
| Week 11 |
| 11/10 | Matchings: Hall's Theorem | |
| 11/13 | Exam #2: No Class | (Solutions) |
| Week 12 |
| 11/17 | Edge Covering & Independence | HW9 (Solutions) |
| 11/20 | Planar Graphs |
| Week 13 |
| 11/24 | Planar Graphs (Kuratowski's Theorem) | HW10 (Solutions) |
| 11/27 | Thanksgiving Recess |
| Week 14 |
| 12/1 | Graph Coloring | |
| 12/4 | Graph Coloring (Con't) |
| Week 15 |
| 12/8 | Exam #3 |