← GATE CSE 2009

Q2

MCQ1 mark, −0.33

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$

Sign in to save attempts.

Loading…