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

Article Tags :

GATE

GATE 2017 MOCK II

GATE-GATE 2017 MOCK II

Recommended Articles

1. GATE | GATE MOCK 2017 | Question 1

2. GATE | GATE MOCK 2017 | Question 2

3. GATE | GATE MOCK 2017 | Question 3

4. GATE | GATE MOCK 2017 | Question 4

5. GATE | GATE MOCK 2017 | Question 5

6. GATE | GATE MOCK 2017 | Question 6

7. GATE | GATE MOCK 2017 | Question 7

8. GATE | GATE MOCK 2017 | Question 8

9. GATE | GATE MOCK 2017 | Question 9

10. GATE | GATE MOCK 2017 | Question 10

11. GATE | GATE MOCK 2017 | Question 11

12. GATE | GATE MOCK 2017 | Question 12

13. GATE | GATE MOCK 2017 | Question 13

14. GATE | GATE MOCK 2017 | Question 14

15. GATE | GATE MOCK 2017 | Question 15

16. GATE | GATE MOCK 2017 | Question 16

17. GATE | GATE MOCK 2017 | Question 17

18. GATE | GATE MOCK 2017 | Question 18

19. GATE | GATE MOCK 2017 | Question 19

20. GATE | GATE MOCK 2017 | Question 20

21. GATE | GATE MOCK 2017 | Question 21

22. GATE | GATE MOCK 2017 | Question 22

23. GATE | GATE MOCK 2017 | Question 24

24. GATE | GATE MOCK 2017 | Question 25

25. GATE | GATE MOCK 2017 | Question 26