GATE | Gate IT 2008 | Question 3
What is the chromatic number of the following graph?
Explanation: The chromatic number of a graph is the smallest number of colors needed to color the vertices so that no two adjacent vertices have the same color.
In this graph, minimum number of colors needed to color given graph would be equal to 3.
Quiz of this Question