A

Admin • 802.91K Points
Coach

Q. 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
  • (C) the given graph is hamiltonian
  • (D) the given graph is planar
Explanation by: Admin
a graph is said to be colorable if two vertices connected by an edge are never of the same color. 2 colorable mean that this can be achieved with just 2 colors.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.