A

Admin • 831.35K Points
Coach

Q. Every Perfect graph has forbidden graph characterization.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
Explanation by: Admin
berge theorem proves the forbidden graph characterization of every perfect graphs. because of that reason every bipartite graph is perfect graph.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.