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. What is the chromatic number of an n-vertex simple connected graph which does not contain any odd length cycle? Assume n >= 2.
a. 2
b. 3
c. n-1
d. n
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: