Question

What will be the chromatic number for an bipartite graph having n vertices?

(a) 0

(b) 1

(c) 2

(d) n

This question was posed to me by my school principal while I was bunking the class.

This key question is from Graph Coloring in section Graph Coloring of Data Structures & Algorithms II

Answer 1

Correct option is (c) 2

Easy explanation - A bipartite graph is graph such that no two vertices of the same set are adjacent to each other. So the chromatic number for such a graph will be 2.