What is the chromatic number of an n-vertex simple connected graph which does not contain any odd length cycle? Assume n >= 2.
(A)
n-1
(B)
3
(C)
2
(D)
n
Answer: (C)
Explanation:
The chromatic number of a graph is the smallest number of colours needed to colour the vertices of so that no two adjacent vertices share the same colour. These types of questions can be solved by substitution with different values of n.
1) n = 2
![\"anil_m_1\"](\"https://cdncontribute.geeksforgeeks.org/wp-content/uploads/GATE_CS_2009_Question_2.jpg\")
This simple graph can be coloured with 2 colours.
2) n = 3
![\"anil_m_2\"](\"https://cdncontribute.geeksforgeeks.org/wp-content/uploads/GATE_CS_2009_Question_21.jpg\")
Here, in this graph let us suppose vertex A is coloured with C1 and vertices B, C can be coloured with colour C2 => chromatic number is 2 In the same way, you can check with other values, Chromatic number is equals to 2
A simple graph with no odd cycles is bipartite graph and a Bipartite graph can be colored using 2 colors
Quiz of this Question
Please comment below if you find anything wrong in the above post
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...