Geodesic
The strong perfect graph theorem
Maria Chudnovsky1 ; Neil Robertson2 ; Paul Seymour3 ; Robin Thomas4
1 Department of Mathematics, Columbia University, New York, NY 10027, United States
2 Department of Mathematics, The Ohio State University, Columbus, OH 43210, United States
3 Department of Mathematics, Princeton University, Princeton, NJ 08544, United States
4 School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332, United States
Annals of mathematics, Tome 164 (2006) no. 1, pp. 51-229.

Voir la notice de l'article provenant de la source Annals of Mathematics website

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.
DOI : 10.4007/annals.2006.164.51

Maria Chudnovsky 1 ; Neil Robertson 2 ; Paul Seymour 3 ; Robin Thomas 4

1 Department of Mathematics, Columbia University, New York, NY 10027, United States
2 Department of Mathematics, The Ohio State University, Columbus, OH 43210, United States
3 Department of Mathematics, Princeton University, Princeton, NJ 08544, United States
4 School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332, United States 
@article{10_4007_annals_2006_164_51,
     author = {Maria Chudnovsky and Neil Robertson and Paul Seymour and Robin Thomas},
     title = {The strong perfect graph theorem},
     journal = {Annals of mathematics},
     pages = {51--229},
     publisher = {mathdoc},
     volume = {164},
     number = {1},
     year = {2006},
     doi = {10.4007/annals.2006.164.51},
     mrnumber = {2233847},
     zbl = {1112.05042},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.4007/annals.2006.164.51/}
}
TY  - JOUR
AU  - Maria Chudnovsky
AU  - Neil Robertson
AU  - Paul Seymour
AU  - Robin Thomas
TI  - The strong perfect graph theorem
JO  - Annals of mathematics
PY  - 2006
SP  - 51
EP  - 229
VL  - 164
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.4007/annals.2006.164.51/
DO  - 10.4007/annals.2006.164.51
LA  - en
ID  - 10_4007_annals_2006_164_51
ER  - 
%0 Journal Article
%A Maria Chudnovsky
%A Neil Robertson
%A Paul Seymour
%A Robin Thomas
%T The strong perfect graph theorem
%J Annals of mathematics
%D 2006
%P 51-229
%V 164
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.4007/annals.2006.164.51/
%R 10.4007/annals.2006.164.51
%G en
%F 10_4007_annals_2006_164_51
Maria Chudnovsky; Neil Robertson; Paul Seymour; Robin Thomas. The strong perfect graph theorem. Annals of mathematics, Tome 164 (2006) no. 1, pp. 51-229. doi : 10.4007/annals.2006.164.51. http://geodesic.mathdoc.fr/articles/10.4007/annals.2006.164.51/

Cité par Sources :