1. Les problèmes de coloration en théorie des graphes;Berge;Publ. Inst. Statist. Univ. Paris,1960
2. Perfectly contractile graphs;Bertschi;J. Combin. Theory Ser. B,1990
3. M. Chudnovski, N. Robertson, P. Seymour, R. Thomas, The strong perfect graph theorem, Manuscript, Princeton University, Princeton, 2002.
4. Which claw-free graphs are perfectly orderable?;Chvátal;Discrete Appl. Math.,1993
5. V. Chvátal, J. Fonlupt, L. Sun, A. Zemirline, Recognizing dart-free perfect graphs, Tech. Report 92778, Institut für Ökonometrie und Operations Research, Rheinische Friedrich Wilhelms Universität, Bonn, Germany, 1992.