The GATE Grind

GATE 2009 CS – Question 2

Engineering Mathematics · Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) · 1 mark · Multiple choice

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

  1. 2
  2. 3
  3. n−1
  4. n

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

All Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions →