A

Admin • 832.70K Points
Coach

Q. What is the simplest method to prove that a graph is bipartite?

  • (A) it has a cycle of an odd length
  • (B) it does not have cycles
  • (C) it does not have a cycle of an odd length
  • (D) both odd and even cycles are formed

Explanation by: Admin

it is not difficult to prove that a graph is bipartite if and only if it does not have a cycle of an odd length.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.