GATE 1990
December 15, 2023UGC NET CS 2014 Dec – paper-3
December 15, 2023GATE 2002
|
Question 4
|
The minimum number of colours required to colour the vertices of a cycle with η nodes in such a way that no two adjacent nodes have the same colour is
|
2
|
|
|
3
|
|
|
4
|
|
|
n – 2[n/2] + 2
|
Question 4 Explanation:
We need 2 colours to colour even cycle and 3 colours to colour odd cycle.
Correct Answer: D
Question 4 Explanation:
We need 2 colours to colour even cycle and 3 colours to colour odd cycle.
