The Strong Perfect Graph Theorem

@article{Chudnovsky2002TheSP,
  title={The Strong Perfect Graph Theorem},
  author={M. Chudnovsky and N. Robertson and P. Seymour and Robin Thomas},
  journal={Annals of Mathematics},
  year={2002},
  volume={164},
  pages={51-229}
}
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. The ?strong perfect graph conjecture? (Berge, 1961) asserts that a graph is perfect if and only if it is Berge. A stronger conjecture was made recently by Conforti, Cornu?ejols and Vuiskovi?c ? that every Berge graph either falls into one of a few basic… Expand
Progress on perfect graphs
Odd Pairs of Cliques
Finding balanced skew partitions in perfect graphs
The perfection and recognition of bull-reducible Berge graphs
Forbidden Induced Subgraphs of Double-split Graphs
Sum-perfect graphs
Towards a constructive formalization of Perfect Graph Theorems
On minimally circular-imperfect graphs
  • Baogang Xu
  • Computer Science, Mathematics
  • Discret. Math.
  • 2008
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 90 REFERENCES
Progress on perfect graphs
A semi-strong Perfect Graph theorem
  • B. Reed
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1987
Some properties of minimal imperfect graphs
  • C. Hoàng
  • Computer Science, Mathematics
  • Discret. Math.
  • 1996
Bull-free Berge graphs are perfect
About Skew Partitions in Minimal Imperfect Graphs
PERMANENTS, PFAFFIAN ORIENTATIONS, AND EVEN DIRECTED CIRCUITS
Tutte's Edge-Colouring Conjecture
Compositions for perfect graphs
ω-Perfect graphs
...
1
2
3
4
5
...