327 views

The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is

| 327 views
+1
4 colors ?
+1
is it 4?
+6

4 colors

0
Is 4 colors needed?
0
E, F, G are adjacent, hence they cant be of the same color, here you have marked them as C1. check again.

I'm getting 4 colors also.
+1

I also got $4$ Colors

0
Minimum 4 colors must be required.
0
Yes that's right.
0
Here i need a minimum of 4 independent sets {b,d,h},{a,g},{f,c},{c,g} whose union gives me entire graph.. So i need 4 colours