in Graph Theory
736 views
8 votes
8 votes

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

in Graph Theory
736 views

4 Comments

Minimum 4 colors must be required.
0
0
Yes that's right.
0
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
0
0

Please log in or register to answer this question.