1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. Every Perfect graph has forbidden graph ...
Q.

Every Perfect graph has forbidden graph characterization.

A. true
B. false
Answer» A. true
Explanation: berge theorem proves the forbidden graph characterization of every perfect graphs. because of that reason every bipartite graph is perfect graph.

Discussion