GATE Papers >> CSE >> 2009 >> Question No 2

Question No. 2 CSE | GATE 2009

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


Answer : (A) 2


Comments
No Comments
Leave a comment
Go