The strong perfect graph theorem

Maria Chudnovsky, Neil Robertson, Paul Seymour, Robin Thomas

Annals of Mathematics · 2006 · 1.3K citations · 17 references

DOIFull text

Open access

Concepts

Abstract

A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one.

References

17