Skip to content
Related Articles

Related Articles

GATE | Gate IT 2008 | Question 3

Improve Article
Save Article
  • Difficulty Level : Medium
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article

What is the chromatic number of the following graph?
2008_3
(A) 2
(B) 3
(C) 4
(D) 5


Answer: (B)

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

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!