Berge graph is similar to ______ due to strong perfect graph theorem.
Berge graph is similar to ______ due to strong perfect graph theorem. Correct Answer perfect graph
In a perfect graph, the chromatic number of each and every induced subgraph is equal to the size of the largest clique of that subgraph. These perfect graphs are same as Berge graphs due to strong perfect graph theorem.
মোঃ আরিফুল ইসলাম
Feb 20, 2025