Today:
- Announcements
- I'm collecting 5.2 homework today.
- I'm returning 5.1 homework:
- 13 -- solution in the text!
- 14 -- non-isomorphic (e.g. loops, degrees, etc.)
- 26 -- if you're going to prove it using bijection, you only need one function, since this is a simple graph.
- Projects are "graded". Project 2 is based on the results of Project 1. If you don't like what I've described in your feedback, you can do something else. Just make sure that it's approved by me first.
- Last time we looked at section 5.3: Decision Trees
- Today we'll check out section 6.2: Euler Paths and Hamiltonian Circuits
Links:
Website maintained by Andy Long.
Comments appreciated.