Varied due dates.
- 7#1: Prove that any planar simple graph with at most
11 vertices has a vertex of degree 4 or less.
- 7#2 Due December 5: (West 4.3.2 on page 188) Extra copies of the
graph are outside my office door. Your goal is to find a flow of
value 17 and a cut of value 17.