Reading Assignments: Lectures #3-4 PS#2: Chapter 2 of O&w Lectures #5-6& PS#3: Chapter 3 of o&w Exercise for home study (not to be turned in, although we will provide solutions)
Reading Assignments: Lectures #1-2& PS#1: Chapter 1 of Oppenheim and Willsky(O& W), including (see p. 71) Lectures #3-4 PS#2: Chapter 2 of Oppenheim and Willsky(O&w)
Problem 1. An undirected graph G has width w if the vertices can be arranged in a se- quence V1,2,3,…,Vn such that each vertex v; is joined by an edge to at most w preceding vertices. (Vertex vj precedes if i.) Use induction to prove that every graph with width at most w is (w+1)-colorable