Due Monday, October 7.

Section 1.4.1: #3
Section 1.4.2: #1, #2, #7
Section 1.4.3: #2, #10, #12  (on #2, recall that a graph is 2-connected if and only if it is connected (added 10/3) and it has no cut vertex)

Section 1.5.1: #1 (second graph only), #7
Section 1.5.2: #1, #5

Extra credit:
Section 1.4.3 #13, Section 1.5.1 #5
A. Show that the graph G₃ from Figure 1.59 on p.61 is traceable, but not Hamiltonian.  Show that the first graph in Figure 1.65 on p. 67 is nontraceable.  Can you see a relation with the fact that K₄ doesn’t have an Eulerian trail?