article Open AccessTop 1% cited
The strong perfect graph theorem
Annals of Mathematics · 2006 · Vol. 164(1) · pp. 51–229
Maria Chudnovsky✉(Columbia University)Neil Robertson(The Ohio State University)Paul Seymour(Princeton University)Robin Thomas(Georgia Institute of Technology)
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.
Limits and Structures in Graph TheoryAdvanced Graph Theory ResearchGraph Labeling and Dimension ProblemsMathematicsGraphPerfect graph theoremCombinatoricsDiscrete mathematicsLine graphVoltage graph
Funding
- National Science Foundation
- Office of Naval Research
Citations
1,271
FWCI
91.00
field-weighted impact
References
24
Percentile
100%
vs. same field & year
Citations per year
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.