GATE | CS | 2004 | Discrete maths | Graph theory | Question 77

Last Updated :
Discuss
Comments

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

GATECS20014Q77

2

3

4

5

Share your thoughts in the comments