A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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⌊n/2⌋ + 2
Answer:n - 2⌊n/2⌋ + 2
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: