Editing Strong perfect graph theorem (section)

==References==
*{{citation
 | last = Berge | first = Claude | author-link = Claude Berge
 | journal = Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe
 | page = 114
 | title = Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind
 | volume = 10
 | year = 1961}}.
*{{citation
 | last = Berge | first = Claude | author-link = Claude Berge
 | contribution = Perfect graphs
 | location = Calcutta
 | pages = 1–21
 | publisher = Indian Statistical Institute
 | title = Six Papers on Graph Theory
 | year = 1963}}.
*{{citation
 | last = Chudnovsky | first = Maria | authorlink = Maria Chudnovsky
 | doi = 10.1002/jgt.20165
 | issue = 1
 | journal = Journal of Graph Theory
 | mr = 2245543
 | pages = 1–55
 | title = Berge trigraphs
 | volume = 53
 | year = 2006}}.
*{{citation
 | last1 = Chudnovsky | first1 = Maria | author1-link = Maria Chudnovsky
 | last2 = Robertson | first2 = Neil | author2-link = Neil Robertson (mathematician)
 | last3 = Seymour | first3 = Paul | author3-link = Paul Seymour (mathematician)
 | last4 = Thomas | first4 = Robin | author4-link = Robin Thomas (mathematician)
 | doi = 10.4007/annals.2006.164.51
 | issue = 1
 | journal = [[Annals of Mathematics]]
 | pages = 51–229
 | title = The strong perfect graph theorem
 | url = http://annals.princeton.edu/annals/2006/164-1/p02.xhtml
 | volume = 164
 | year = 2006
 | mr = 2233847| arxiv = math/0212070}}.
*{{citation
 | last1 = Chudnovsky | first1 = Maria | author1-link = Maria Chudnovsky
 | last2 = Robertson | first2 = Neil | author2-link = Neil Robertson (mathematician)
 | last3 = Seymour | first3 = Paul | author3-link = Paul Seymour (mathematician)
 | last4 = Thomas | first4 = Robin | author4-link = Robin Thomas (mathematician)
 | doi = 10.1007/s10107-003-0449-8
 | series = Series B.
 | issue = 1–2
 | journal = Mathematical Programming
 | pages = 405–422
 | title = Progress on perfect graphs
 | volume = 97
 | year = 2003
 | mr = 2004404| citeseerx = 10.1.1.137.3013 }}.
*{{citation
 | last = Chvátal | first = Václav | authorlink = Václav Chvátal
 | doi = 10.1016/0095-8956(85)90049-8
 | issue = 3
 | journal = Journal of Combinatorial Theory
 | mr = 815391
 | pages = 189–199
 | series = Series B
 | title = Star-cutsets and perfect graphs
 | volume = 39
 | year = 1985| doi-access = 
 }}.
*{{citation
 | last1 = Chvátal | first1 = Václav | author1-link = Václav Chvátal
 | last2 = Sbihi | first2 = Najiba | author2-link = Najiba Sbihi
 | doi = 10.1007/BF01788536
 | issue = 2
 | journal = [[Graphs and Combinatorics]]
 | mr = 932129
 | pages = 127–139
 | title = Bull-free Berge graphs are perfect
 | volume = 3
 | year = 1987}}.
*{{citation
 | last = Cornuéjols | first = Gérard | authorlink = Gérard Cornuéjols
 | contribution = The strong perfect graph conjecture
 | location = Beijing
 | mr = 1957560
 | pages = 547–559
 | publisher = Higher Ed. Press
 | title = Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002)
 | url = https://www.mathunion.org/fileadmin/ICM/Proceedings/ICM2002.3/ICM2002.3.ocr.pdf
 | year = 2002}}.
*{{citation
 | last1 = Cornuéjols | first1 = G. | author1-link = Gérard Cornuéjols
 | last2 = Cunningham | first2 = W. H.
 | doi = 10.1016/S0012-365X(85)80001-7
 | issue = 3
 | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
 | mr = 802663
 | pages = 245–254
 | title = Compositions for perfect graphs
 | volume = 55
 | year = 1985| doi-access = free
 }}.
*{{citation
 | last = Hougardy | first = S.
 | location = Grenoble, France
 | publisher = Laboratoire Artemis-IMAG, Universitá Joseph Fourier
 | series = Technical Report RR870-M
 | title = Counterexamples to three conjectures concerning perfect graphs
 | year = 1991}}. As cited by {{harvtxt|Roussel|Rusu|Thuillier|2009}}.
*{{citation
  | last = Kőnig | first = Dénes  | authorlink = Dénes Kőnig
  | title = Gráfok és alkalmazásuk a determinánsok és a halmazok elméletére
  | journal = Matematikai és Természettudományi Értesítő
  | volume = 34
  | year = 1916
  | pages = 104–119}}.
*{{citation
 | last = Lovász | first = László | authorlink = László Lovász
 | year = 1972a
 | title = Normal hypergraphs and the perfect graph conjecture
 | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
 | volume = 2
 | issue = 3
 | pages = 253–267
 | doi = 10.1016/0012-365X(72)90006-4| doi-access = 
 }}.
*{{citation
 | last = Lovász | first = László | author-link = László Lovász
 | doi = 10.1016/0095-8956(72)90045-7
 | issue = 2
 | journal = [[Journal of Combinatorial Theory]] | series = Series B
 | pages = 95–98
 | title = A characterization of perfect graphs
 | volume = 13
 | year = 1972b| doi-access = 
 }}.
*{{citation
 | last = Mackenzie | first = Dana
 | date = July 5, 2002
 | doi = 10.1126/science.297.5578.38
 | issue = 5578
 | journal = [[Science (journal)|Science]]
 | page = 38
 | pmid = 12098683
 | title = Mathematics: Graph theory uncovers the roots of perfection
 | volume = 297}}.
*{{citation
 | last = Reed | first = B. A. | authorlink = Bruce Reed (mathematician)
 | location = Montréal, Québec, Canada
 | publisher = Department of Computer Science, McGill University
 | series = Ph.D. thesis
 | title = A semi-strong perfect graph theorem
 | year = 1986}}. As cited by {{harvtxt|Roussel|Rusu|Thuillier|2009}}.
*{{citation
 | last1 = Roussel | first1 = F.
 | last2 = Rusu | first2 = I.
 | last3 = Thuillier | first3 = H.
 | doi = 10.1016/j.disc.2009.05.024
 | issue = 20
 | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
 | mr = 2552645
 | pages = 6092–6113
 | title = The strong perfect graph conjecture: 40 years of attempts, and its resolution
 | volume = 309
 | year = 2009| doi-access = free
 }}.
*{{citation
 | last = Rusu | first = Irena
 | doi = 10.1016/S0012-365X(96)00081-7
 | issue = 1–3
 | journal = Discrete Mathematics
 | mr = 1454452
 | pages = 213–227
 | title = Building counterexamples
 | volume = 171
 | year = 1997| doi-access = 
 }}.
*{{citation
 | last = Seymour | first = Paul | authorlink = Paul Seymour (mathematician)
 | issue = 109
 | journal = Gazette des Mathématiciens
 | mr = 2245898
 | pages = 69–83
 | title = How the proof of the strong perfect graph conjecture was found
 | url = http://users.encs.concordia.ca/~chvatal/perfect/pds.pdf
 | year = 2006}}.