GATE CS 2009 — Question 12

Multiple choice 1 mark Question 12 2009

Question 12

MCQ 1 marks · −0.33 Discrete Mathematics

What is the chromatic number of an \(n\)-vertex simple connected graph which does not contain any odd-length cycle? Assume \(n \geq 2\).

A 2 B 3 C \(n-1\) D \(n\)

Answers and explanations are free — they just need an account.

GATE CS — Computer Science & IT 2009 Discrete Mathematics

Source: GATE 2009 Computer Science and Engineering (question number approximate)