Question

How many unique colors will be required for proper vertex coloring of a bipartite graph having n vertices?

(a) 0

(b) 1

(c) 2

(d) n

I got this question by my college professor while I was bunking the class.

I want to ask this question from Graph Coloring in portion Graph Coloring of Data Structures & Algorithms II

Answer 1

Right answer is (c) 2

Easiest explanation - A bipartite graph is a graph such that no two vertices of the same set are adjacent to each other. So the number of unique colors required for proper coloring of the graph will be 2.