graph_perfect (283B)
1 # Graph perfect 2 3 [Undirected_graph] G where for every [induced_subgraph] H of G, the [chromatic_number] of H is equal to the size of the [largest_clique] of H 4 5 - [strong_perfect_graph_theorem]: a graph is perfect iff it is a [berge_graph] 6 7 Up: [graph_family] 8 9 Aliases: perfect graph