Perfect graphs

Computing portal

Here is a list of articles in the Perfect graphs category of the Computing portal that unifies foundations of mathematics and computations using computers.

A graph is perfect if it can be colored with as many colors as it has vertices in its maximum clique, and if moreover the same property is true in every induced subgraph. This category collects families of graphs that are notable for being perfect, as well as some related mathematical results.