C. Berge, Färbungen von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind, pp.114-115, 1961.

M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The strong perfect graph theorem, Annals of Mathematics, vol.164, issue.1, pp.51-229, 2006.
DOI : 10.4007/annals.2006.164.51

V. Chvátal, On certain polytopes associated with graphs, Journal of Combinatorial Theory, Series B, vol.18, issue.2, pp.138-154, 1975.
DOI : 10.1016/0095-8956(75)90041-6

M. Grötschel, L. Lovász, and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, vol.2, issue.2, pp.169-197, 1981.
DOI : 10.1007/BF02579273

M. Grötschel, L. Lovász, and A. Schrijver, Topics on perfect graphs Polynomial algorithms for perfect graphs, pp.325-356, 1984.

M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, 1988.

D. Karger, R. Motwani, and M. Sudan, Approximate graph coloring by semidefinite programming, Journal of the ACM, vol.45, issue.2, pp.246-265, 1998.
DOI : 10.1145/274787.274791

L. Lovász, A characterization of perfect graphs, Journal of Combinatorial Theory, Series B, vol.13, issue.2, pp.95-98, 1972.
DOI : 10.1016/0095-8956(72)90045-7

L. Lovász, Normal hypergraphs and the perfect graph conjecture, Discrete Mathematics, vol.2, issue.3, pp.253-267, 1972.
DOI : 10.1016/0012-365X(72)90006-4

L. Lovász, On the Shannon capacity of a graph, IEEE Transactions on Information Theory, vol.25, issue.1, pp.1-7, 1979.
DOI : 10.1109/TIT.1979.1055985

A. Pêcher and A. Wagler, Beyond Perfection: Computational Results for Superclasses, p.2013
DOI : 10.1007/978-3-642-38189-8_6

M. Szegedy, A note on the ?? number of Lovasz and the generalized Delsarte bound, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.36-39, 1994.
DOI : 10.1109/SFCS.1994.365707

C. E. Shannon, The zero error capacity of a noisy channel, IEEE Transactions on Information Theory, vol.2, issue.3, pp.8-19, 1956.
DOI : 10.1109/TIT.1956.1056798