3 For the following graphs attempt a two-colorization to show or refute that it's bipartite. [3/each = 6] Hint: Try it on a separate page first, it can get messy! OP 4 The complementary graph co(G) of a simple graph G has the same vertices as G. Two distinct vertices are adjacent in co(G) if and only if they are not adjacent in G. Draw the graph co(W3). [5]COT 3100 Homework 6 You again can get 35 points. a) b) ( ) d) red 100 e) f) 9) h) 3 8 5 1 For the eight graphs above: 1.1 Check the box if it's simple [1/ea = 8] a [ ] b[ ] c[ ] d[ ] e [ ] f [ ] h [ ] 1.2 Which of these graphs are directed? [1/ea = 8] a[ ] b[ ] d[ ] f[ ] g [ ] h[ ] 2 Draw the following graphs (see slides/textbook) [2/ea = 8] a) Ks b) K3.5 d) Cs e) Ws