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. k
Explanation: The chromatic number is defined as the minimum number of colors required for proper coloring. Here it states it requires k, so it is k.