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. Directed graphs |
| Week 8 | Oct 13: Tournaments | Oct 15: Coloring Homework assignment 4 due. |
| Week 9 | Oct 20: Coloring parameters, Brooks' Theorem | Oct 22: Quiz 4 in class today. Mycielski's construction |
| Week 10 | Oct 27: Hajos' Conjecture and Hadwiger's Conjecture | Oct 29: Chromatic polynomials Homework assignment 5 due. |
| Week 11 | Nov 3: Advising day, no class today! | Nov 5: Exploration 3 due. Planar graphs |
| Week 12 | Nov 10: Quiz 5 in class today Euler's formula and consequences |
Nov 12: The Four Color Theorem |
| Week 13 | Nov 17: Kuratowski's Theorem | Nov 19: |
| Week 14 | Nov 24: | Nov 26: Fall break, no class today! |
| Week 15 | Dec 1: Quiz 6 in class today. | Dec 3: |
| Finals | Monday Dec 7: 8:00-11:00 Final presentations |