Perfect graphGraphe parfait
Graph with tight clique-coloring relation
In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every induced subgraph.En théorie des graphes, le graphe parfait est une notion introduite par Claude Berge en 1960.
