Vidyalelo
Data Structure · Q545

Miscellaneous on Data Structures

Programming · Data Structure · question 545

Q545

A graph is found to be 2 colorable. What can be said about that graph?

A.
The given graph is eulerian
B.
The given graph is bipartite
Answer
C.
The given graph is hamiltonian
D.
The given graph is planar

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board