GATE | GATE 2017 MOCK II | Question 32

Given a graph G (V, E) is Bipartite, what is the chromatic number of G ?
(A) 2
(B) 3
(C)
(D) Can’t be decided


Answer: (A)

Explanation: Since the graph G is bipartite, the vertices set V can be partitioned into two disjoint sets.
This shows that we can color the graph with 2 colors such that no two adjacent vertices will have same color.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.