GATE | GATE-CS-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
(D) n – 2⌊n/2⌋ + 2
Explanation: We need 3 colors to color a odd cycle and 2 colors to color an even cycle.
Quiz of this Question