Lecture 12 (28 February)

We discussed some issues from the quiz, most notably:

• The definitions of distance in graphs and graph diameter.
• Chromatic numbers for cycle graphs. Why can the chromatic number be larger than the biggest K_n in the graph?

We also did exercises on

• Chromatic numbers for graphs made from other graphs.
• Methods for building Euler paths and circuits.
• Using Euler circuits for reconstructing DNA from fragments.

Announcements

• For this Thursday, there are readings but no quiz, due to the nature of the material.
• The quiz for next Tuesday will include a quick survey about important matters such as how long it takes to do the quizzes.
• We're expecting to release exam grades late this week. Details of returning the physical exams are still TBD, because they depend on exactly when the grading gets done.
• We're hassling the section leaders who still don't have homework 3 and/or 4 grades up. (Some of these have appeared on moodle since we started the hassling.)