Skip to content
Related Articles

Related Articles

GATE | GATE-CS-2002 | Question 4
  • Difficulty Level : Medium
  • Last Updated : 29 Nov, 2014

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
(A) 2
(B) 3
(C) 4
(D) n – 2⌊n/2⌋ + 2


Answer: (D)

Explanation: We need 3 colors to color a odd cycle and 2 colors to color an even cycle.

Quiz of this Question

sudo-gate-course

My Personal Notes arrow_drop_up
Recommended Articles
Page :