hw1
3.2 # 1,2,7,14,19,20
Due Wednesday 1/22

hw2
3.2 # 6,23,24,29
Due Monday 1/27

hw?
4.1 # 1,3,4,17,18,21,33,39
Due Monday 2/3

hw?
4.3 # 4,9,14,15,16,20,22,27,48,55
Due Monday 2/10

hw?
4.6 # 4,5,8,9ad,11,14,16a,20,26,29,34
Due Monday 2/24

hw?
4.4 # 14,15,17,21,31,32,34
4.5 # 20,29,33,41
Due Monday 3/3

hw?
5.4 # 4h,32
7.1 # 11a
7.2 # 4,8,12abd,13,14,15
Due Wednesday 4/2

hw9
7.2 # 18ab,19abd,20,22,28,33ab,34,37
7.3 # 6,7,9c,26,35,36,50,57a,63
Due Monday 4/7

hw10
If G is a graph with at least 6 vertices the either 
G is the complement of G has a triangle. Write up
the case with discussed in class. For extra credit
write a complete proof. You may construct a proof 
different from the one in class.
Due Wednesday 4/9

hw11
7.3 # 69
7.4 # 1,2,6,7ab,9ab,10a,16,27,34
7.5 # 1,2,16,36ab,45,46,54ab
Due Monday 4/14

hw 12
7.6 # Use Dijkstra's algorithm to do #2,#3
7.6 # 18,20
7.7 # 4,5,10,12,18,19
7.8 # 1c,2c,4,11,16,20a for n=4 or n=5,20b for m=3 and n=2
8.1 # 1,2,6b,10,12,14 
Due Wednesday 4/23

Recommended homework
8.6 # 1,7,13
8.3 # 26,27,28,34