articleAnnals of MathematicsJul 1, 2006BRONZE OA

The strong perfect graph theorem

MCMaria ChudnovskyNRNeil RobertsonPSPaul SeymourRTRobin Thomas

Columbia University · The Ohio State University · +2 more institutions

Indexed incrossref

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.

Citation impact

1,289
total citations
FWCI
88.96
Percentile
100%
References
24
Citations per year

Authors

4

Topics & keywords

Topics
Keywords
  • Mathematics
  • Graph
  • Perfect graph theorem
  • Combinatorics
  • Discrete mathematics
  • Line graph
  • Voltage graph
No related works found for this paper.

Funding