Category:Perfect graphs

From Wikipedia, the free encyclopedia
Jump to: navigation, search
The main article for this category is Perfect graph.

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.