GATE 2009 CS – Question 2
What is the chromatic number of an n-vertex simple connected graph which does not contain any odd-length cycle? Assume $n\ge2$.
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (A) 2
Explanation
We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort
More Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions
- GATE 2009 CS Q3
- GATE 2008 CS Q23
- GATE 2008 CS Q42
- GATE 2007 CS Q4
- GATE 2007 CS Q23
- GATE 2026 CS (CS1) Q55
All Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions →