Course calendar:
| Week 1 | Aug 25: First day of class. Introduction to graphs, graph isomorphism | Aug 27: Subgraphs |
| Week 2 | Sep 1: Walks, paths, circuits, and cycles | Sep 3: Eulerian circuits and Hamiltonian cycles Homework assignment 1 due. |
| Week 3 | Sep 8: Graph algorithms in pseudocode Quiz 1 in class today. Exploration 1 due. |
Sep 10: Graph theory in Python |
| Week 4 | Sep 15: Trees | Sep 17: Proving the Big Tree Theorem Homework assignment 2 due. |
| Week 5 | Sep 22: Kruskal's algorithm and Dijkstra's algorithm | Sep 24: Quiz 2 in class today. |
| Week 6 | Sep 29: Matchings | Oct 1: Coverings Homework assignment 3 due. |
| Week 7 | Oct 6: Matching and covering theorems Exploration 2 due. |
Oct 8: Quiz 3 in class today. |