Schedule
This is a log of what was actually done.
Jan 12 Chapter 1.1, 1.2
Jan 14 Chapter 1.3
Jan 19 Chapter 2.1 and 2.2
Jan 21 Chapter 2.3 and 2.4
Jan 26
Jan 28 Chapter 3.1 and 3.2
Feb 2 Chapter 4.1 and 4.2
Feb 4 Chapter 4.2 and 4.3
Feb 9 midterm review
Feb 11 Midterm
Feb 16 red-blue algorithm and counting spanning trees of K_n
Feb 18 Counting number of spanning trees using determinants
Feb 23 Chapter 5.1 and 5.2 connectivity
Feb 25 Chapter 5.3 and Ear decomposition theorem
Mar 1 Chapter 5.4 Menger's Theorem
Mar 3 Network Flows
Mar 8 midterm review
Mar 10 Midterm
Mar 15 Spring break
Mar 17 Spring break
Mar 22 Matchings I chapter 8.1
Mar 24 Matchings II chapter 8.1
Mar 29 Eilerian Graphs chapter 6.1
Mar 31 Hamiltonina Graphs chapter 6.2
Apr 5 Factorization I chapter 8.2
Apr 7 Factorization II chapter 8.2
Apr 12 Planar graphs
Apr 14 Graphs on Surfaces
Apr 19 midterm review
Apr 21 Midterm
Apr 26 Graph Coloring 1
Apr 28 Graph Coloring 2
May 2 Final Exam