A

Admin • 832.70K Points
Coach

Q. Given that a graph contains no odd cycle. Is it enough to tell that it is bipartite?

  • (A) yes
  • (B) no
  • (C) ---
  • (D) ---

Explanation by: Admin

it is required that the graph is connected also. if it is not then it cannot be called a bipartite graph.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.