Gateforum Test Series: Graph Theory - Graph connectivity

Question

Comments

Chromatic Number should be 2.

---

Yes @dilip

The question is not asking for chromatic number.

---

Condition for checking whether a graph is bipartite or not:

1. A bipartite graph is 2 colorable means its chromatic number is $2$.
2. A bipartite graph does not contain any odd-length cycle.

 

Answer 1

Option is C (G1,G3) are bipartite 

1.Bipartite graph doesn have odd length cycle