Latest Gate Aptitude Question SOLUTION: The minimum number of colours required to colour the vertices of a cycle with n nodes in such a way that no two adjacent nodes have the same colour is (a) 2 (b) 3 (c) 4 (d) n_2[+2

• Placement Papers
• /
• Gate

Gate Question Papers:

(#M40021678) GATE question MATHS Keep an EYE

The minimum number of colours required to colour the vertices of a cycle with n nodes in
such a way that no two adjacent nodes have the same colour is
(a) 2
(b) 3
(c) 4
(d) n_2[+2

Asked In Gate MAN (10 years ago)

Unsolved

Is this Puzzle helpful?   (8)   (3) Submit Your Solution