If a graph requires k different colours for its proper colouring, then the chromatic number of the graph is
(A) 1
(B) k
(C) k-1
(D) k/2
Answer: (B)
Explanation: The chromatic number of a graph is the smallest number of colors needed to color the vertices of so that no two adjacent vertices share the same color and if a graph requires k different colours for its proper colouring, then k is the chromatic number of the graph.
Quiz of this Question
Article Tags :