Editing Perfect graph (section)

==References==
{{reflist|refs=

<ref name=berge-1961>{{cite journal
  | author = Berge, Claude
  | author-link = Claude Berge
  | year = 1961
  | title = Färbung von Graphen deren sämtliche bzw. deren ungerade Kreise starr sind
  | journal = Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe
  | volume = 10
  | pages = 114}}</ref>

<ref name=berge-1963>{{cite conference
 | 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}}</ref>

<ref name=berge-1967>{{cite book
 | last = Berge | first = Claude | author-link = Claude Berge
 | contribution = Some classes of perfect graphs
 | mr = 0232694
 | pages = 155–165
 | publisher = Academic Press | location = London
 | title = Graph Theory and Theoretical Physics
 | year = 1967
 | zbl = 0203.26403}}</ref>

<ref name=bg-2006>{{cite journal
 | last1 = Boros | first1 = E. | author1-link = Endre Boros
 | last2 = Gurvich | first2 = V.
 | doi = 10.1016/j.disc.2005.12.031
 | issue = 19–20
 | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
 | mr = 2261906
 | pages = 2336–2354
 | title = Perfect graphs, kernels, and cores of cooperative games
 | volume = 306
 | year = 2006
 | zbl = 1103.05034}}</ref>

<ref name=bipartite>{{cite web|url=https://www.graphclasses.org/classes/gc_69.html|title=Bipartite graphs|work=Information System on Graph Classes and their Inclusions|access-date=2023-01-24}}</ref>

<ref name=bm-1986>{{cite journal
 | last1 = Bandelt | first1 = Hans-Jürgen
 | last2 = Mulder | first2 = Henry Martyn
 | doi = 10.1016/0095-8956(86)90043-2 | doi-access = 
 | issue = 2
 | journal = [[Journal of Combinatorial Theory]]
 | mr = 859310
 | pages = 182–208
 | series = Series B
 | title = Distance-hereditary graphs
 | volume = 41
 | year = 1986
 | zbl = 0605.05024}}</ref>

<ref name=cclsv-2005>{{cite journal
 | last1 = Chudnovsky | first1 = Maria | author1-link = Maria Chudnovsky
 | last2 = Cornuéjols | first2 = Gérard | author2-link = Gérard Cornuéjols
 | last3 = Liu | first3 = Xinming
 | last4 = Seymour | first4 = Paul | author4-link = Paul Seymour (mathematician)
 | last5 = Vušković | first5 = Kristina | author5-link = Kristina Vušković
 | doi = 10.1007/s00493-005-0012-8 | doi-access = 
 | issue = 2
 | journal = [[Combinatorica]]
 | pages = 143–186
 | title = Recognizing Berge graphs
 | volume = 25
 | year = 2005| s2cid = 2229369 }}</ref>

<ref name=cd-1999>{{cite journal
 | last1 = Cicerone | first1 = Serafino
 | last2 = Di Stefano | first2 = Gabriele
 | doi = 10.1016/S0166-218X(99)00075-X
 | issue = 1–3
 | journal = [[Discrete Applied Mathematics]]
 | mr = 1708837
 | pages = 197–216
 | title = Graph classes between parity and distance-hereditary graphs
 | volume = 95
 | year = 1999
 | zbl = 0933.05144}}</ref>

<ref name=chvatal-1975>{{cite journal
 | last = Chvátal | first = Václav | author-link = Václav Chvátal
 | doi = 10.1016/0095-8956(75)90041-6
 | journal = [[Journal of Combinatorial Theory, Series B]]
 | mr = 371732
 | pages = 138–154
 | title = On certain polytopes associated with graphs
 | volume = 18
 | year = 1975
 | issue = 2 | zbl = 0277.05139}}</ref>

<ref name=clsb-1981>{{cite journal
 | last1 = Corneil | first1 = D. G. | author1-link = Derek Corneil
 | last2 = Lerchs | first2 = H.
 | last3 = Stewart Burlingham | first3 = L.
 | doi = 10.1016/0166-218X(81)90013-5 | doi-access=
 | issue = 3
 | journal = [[Discrete Applied Mathematics]]
 | mr = 0619603
 | pages = 163–174
 | title = Complement reducible graphs
 | volume = 3
 | year = 1981
 | zbl = 0463.05057}}</ref>

<ref name=cornuejols-2002>{{cite conference
 | last = Cornuéjols | first = Gérard | author-link = Gérard Cornuéjols
 | arxiv = math/0304464
 | contribution = The strong perfect graph conjecture
 | mr = 1957560
 | pages = 547–559
 | publisher = Higher Education Press | location = Beijing
 | title = Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002)
 | year = 2002
 | zbl = 1004.05034}}</ref>

<ref name=crst-2003>{{cite journal
 | 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
 | issue = 1-2(B)
 | journal = Mathematical Programming
 | mr = 2004404
 | pages = 405–422
 | title = Progress on perfect graphs
 | url = https://thomas.math.gatech.edu/PAP/perfsur.pdf
 | volume = 97
 | year = 2003
 | zbl = 1028.05035| s2cid = 5226655 }}</ref>

<ref name=crst-2006>{{cite journal
 | 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)
 | arxiv = math/0212070
 | doi = 10.4007/annals.2006.164.51
 | issue = 1
 | journal = [[Annals of Mathematics]]
 | mr = 2233847
 | pages = 51–229
 | s2cid = 119151552
 | title = The strong perfect graph theorem
 | url = https://annals.princeton.edu/annals/2006/164-1/p02.xhtml
 | volume = 164
 | year = 2006
 | zbl = 1112.05042}}</ref>

<ref name=cs-2005>{{cite conference
 | last1 = Chudnovsky | first1 = Maria | author1-link = Maria Chudnovsky
 | last2 = Seymour | first2 = Paul | author2-link = Paul Seymour (mathematician)
 | contribution = The structure of claw-free graphs
 | contribution-url = https://web.math.princeton.edu/~mchudnov/claws_survey.pdf
 | isbn = 0-521-61523-2
 | mr = 2187738
 | pages = 153–171
 | publisher = Cambridge University Press
 | title = Surveys in combinatorics 2005. Papers from the 20th British combinatorial conference, University of Durham, Durham, UK, July 10–15, 2005.
 | year = 2005
 | zbl = 1109.05092}}</ref>

<ref name=dgp-1988>{{cite journal
 | last1 = Dagan | first1 = Ido
 | last2 = Golumbic | first2 = Martin Charles | author2-link = Martin Charles Golumbic
 | last3 = Pinter | first3 = Ron Yair | author3-link = Ron Pinter
 | doi = 10.1016/0166-218X(88)90032-7
 | issue = 1
 | journal = [[Discrete Applied Mathematics]]
 | mr = 953414
 | pages = 35–46
 | title = Trapezoid graphs and their coloring
 | volume = 21
 | year = 1988
 | zbl = 0658.05067}}</ref>

<ref name=dirac>{{cite journal
 | last = Dirac | first = G. A. | authorlink = Gabriel Andrew Dirac
 | doi = 10.1007/BF02992776
 | mr = 0130190
 | journal = Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg
 | pages = 71–76
 | title = On rigid circuit graphs
 | volume = 25
 | year = 1961| issue = 1–2 | s2cid = 120608513
 }}</ref>

<ref name=ffr-1997>{{cite journal
 | last1 = Faudree | first1 = Ralph | author1-link = Ralph Faudree
 | last2 = Flandrin | first2 = Evelyne
 | last3 = Ryjáček | first3 = Zdeněk
 | doi = 10.1016/S0012-365X(96)00045-3 | doi-access = free
 | issue = 1–3
 | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
 | pages = 87–147
 | title = Claw-free graphs — A survey
 | volume = 164
 | year = 1997
 | mr = 1432221}}</ref>

<ref name=fh77>{{cite conference
 | last1 = Földes | first1 = Stéphane
 | last2 = Hammer | first2 = Peter Ladislaw | author2-link =Peter Ladislaw Hammer
 | contribution = Split graphs
 | title = Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La., 1977)
 | pages = 311–315
 | series = Congressus Numerantium
 | volume = XIX
 | publisher = Utilitas Math.
 | location = Winnipeg
 | year = 1977
 | mr = 0505860}}</ref>

<ref name=fulkerson-prize-1991>{{cite journal|url=http://www.mathopt.org/Old-Optima-Issues/optima35.pdf|department=1991 Prize Recipients|title=The 1991 D. R. Fulkerson Prizes in Discrete Mathematics|pages=4–8|journal=Optima: Mathematical Optimization Society Newsletter|issue=35|date=November 1991|access-date=2023-01-21}}</ref>

<ref name=fulkerson-prize-2009>{{cite web|url=http://www.mathopt.org/?nav=fulkerson_2009|title=2009 Fulkerson Prize Citation|publisher=Mathematical Optimization Society|access-date=2023-01-21}}</ref>

<ref name=gallai-1958>{{cite journal
 | last = Gallai | first = Tibor | author-link = Tibor Gallai
 | doi = 10.1007/BF02020271 | doi-access = 
 | issue = 3–4
 | journal = [[Acta Mathematica Academiae Scientiarum Hungaricae]]
 | mr = 0124238 
 | pages = 395–434
 | s2cid = 123953062
 | title = Maximum-minimum Sätze über Graphen
 | volume = 9
 | year = 1958
 | zbl = 0084.19603}}</ref>

<ref name=gasparyan>{{cite journal
 | last = Gasparian | first = G. S.
 | date = June 1996
 | doi = 10.1007/bf01844846
 | issue = 2
 | journal = [[Combinatorica]]
 | pages = 209–212
 | title = Minimal imperfect graphs: A simple approach
 | volume = 16}}</ref>

<ref name=gavril-1972>{{cite journal
 | last = Gavril | first = Fanica
 | doi = 10.1137/0201013
 | issue = 2
 | journal = [[SIAM Journal on Computing]]
 | pages = 180–187
 | title = Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph
 | volume = 1
 | year = 1972}}</ref>

<ref name=gl88>{{cite journal
 | last1 = Gyárfás | first1 = A.
 | last2 = Lehel | first2 = J.
 | date = June 1988
 | doi = 10.1002/jgt.3190120212
 | issue = 2
 | journal = [[Journal of Graph Theory]]
 | pages = 217–227
 | title = On-line and first fit colorings of graphs
 | volume = 12}}</ref>

<ref name=gls-1984>{{cite book
 | last1 = Grötschel | first1 = Martin | author1-link = Martin Grötschel
 | first2 = László | last2 = Lovász | author-link2 = László Lovász
 | first3 = Alexander | last3 = Schrijver | author3-link = Alexander Schrijver
 | editor1-last = Berge | editor1-first = C.
 | editor2-last = Chvátal | editor2-first = V.
 | contribution = Polynomial algorithms for perfect graphs
 | contribution-url = https://ir.cwi.nl/pub/10054
 | doi = 10.1016/S0304-0208(08)72943-8
 | mr = 778770
 | pages = 325–356
 | publisher = North-Holland, Amsterdam
 | series = North-Holland Mathematics Studies
 | title = Topics on perfect graphs
 | volume = 88
 | year = 1984 | isbn = 978-0-444-86587-8 }}</ref>

<ref name=gls-1988>{{cite book
 | last1 = Grötschel | first1 = Martin | author1-link = Martin Grötschel
 | first2 = László | last2 = Lovász | author-link2 = László Lovász
 | first3 = Alexander | last3 = Schrijver | author3-link = Alexander Schrijver
 | mr = 0936633
 | title = Geometric Algorithms and Combinatorial Optimization
 | publisher = Springer-Verlag
 | year = 1988
 | zbl = 0634.05001}} See especially chapter 9, "Stable Sets in Graphs", pp.&nbsp;273–303.</ref>

<ref name=golumbic-1978>{{cite journal
 | last = Golumbic | first = Martin Charles | author-link = Martin Charles Golumbic
 | doi = 10.1016/0012-365X(78)90178-4
 | issue = 1
 | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
 | mr = 522739
 | pages = 105–107
 | title = Trivially perfect graphs
 | volume = 24
 | year = 1978
 | zbl = 0384.05057}}</ref>

<ref name=golumbic-1980>{{Cite book
  | author = Golumbic, Martin Charles
  | author-link = Martin Charles Golumbic
  | doi = 10.1016/C2013-0-10739-8
  | title = Algorithmic Graph Theory and Perfect Graphs
  | publisher = Academic Press
  | year = 1980
  | isbn = 0-444-51530-5}} Second edition, ''Annals of Discrete Mathematics'' 57, Elsevier, 2004.</ref>

<ref name=gt-2004>{{cite book
 | last1 = Golumbic | first1 = Martin Charles | author1-link = Martin Charles Golumbic
 | last2 = Trenk | first2 = Ann N. | author2-link = Ann Trenk
 | doi = 10.1017/CBO9780511542985
 | isbn = 0-521-82758-2
 | mr = 2051713
 | publisher = Cambridge University Press
 | series = Cambridge Studies in Advanced Mathematics
 | title = Tolerance graphs
 | volume = 89
 | year = 2004}}</ref>

<ref name=gyarfas-1987>{{cite journal
 | last = Gyárfás | first = A. | authorlink = András Gyárfás
 | department = Proceedings of the International Conference on Combinatorial Analysis and its Applications (Pokrzywna, 1985)
 | issue = 3–4
 | journal = Zastosowania Matematyki
 | mr = 951359
 | pages = 413–441 (1988)
 | title = Problems from the world surrounding perfect graphs
 | url = http://real-eod.mtak.hu/2132/1/SZTAKITanulmanyok_177.pdf
 | volume = 19
 | year = 1987}}</ref>

<ref name=harary-74>{{cite conference
 | last = Harary | first = Frank | author-link = Frank Harary
 | editor1-last = Bari | editor1-first = Ruth A. | editor1-link = Ruth Aaronson Bari
 | editor2-last = Harary | editor2-first = Frank
 | contribution = Recent results on trees
 | doi = 10.1007/bfb0066429
 | isbn = 9783540378099
 | pages = 1–9
 | publisher = Springer
 | series = Lecture Notes in Mathematics
 | title = Graphs and Combinatorics: Proceedings of the Capital Conference on Graph Theory and Combinatorics at the George Washington University, June 18–22, 1973
 | volume = 406
 | year = 1974}}</ref>

<ref name=harzheim-2005>{{cite book
 | last = Harzheim | first = Egbert
 | contribution = Comparability graphs
 | doi = 10.1007/0-387-24222-8_12
 | isbn = 0-387-24219-8
 | mr = 2127991
 | pages = 353–368
 | publisher = Springer | location = New York
 | series = Advances in Mathematics
 | title = Ordered Sets
 | volume = 7
 | year = 2005
 | zbl = 1072.06001}}</ref>

<ref name=hk-2007>{{cite journal
 | last1 = Heggernes | first1 = Pinar | author1-link = Pinar Heggernes
 | last2 = Kratsch | first2 = Dieter
 | issue = 1–2
 | journal = Nordic Journal of Computing
 | mr = 2460558
 | pages = 87–108 (2008)
 | title = Linear-time certifying recognition algorithms and forbidden induced subgraphs
 | url = http://www.ii.uib.no/~pinar/certifying-NJC.pdf
 | volume = 14
 | year = 2007
 | zbl = 1169.68653}}</ref>

<ref name=hm90>{{cite journal
 | last1 = Hammer | first1 = Peter L.
 | last2 = Maffray | first2 = Frédéric
 | doi = 10.1016/0166-218x(90)90131-u
 | issue = 1–2
 | journal = [[Discrete Applied Mathematics]]
 | pages = 85–99
 | title = Completely separable graphs
 | volume = 27
 | year = 1990| doi-access = free
 }}</ref>

<ref name=hoang-1987>{{cite journal
 | last = Hoàng | first = C. T.
 | doi = 10.1016/0095-8956(87)90047-5 | doi-access = 
 | issue = 3
 | journal = [[Journal of Combinatorial Theory, Series B]]
 | mr = 888682
 | pages = 302–312
 | title = On a conjecture of Meyniel
 | volume = 42
 | year = 1987
 | zbl = 0634.05058}}</ref>

<ref name=hougardy-2006>{{cite journal
 | last = Hougardy | first = Stefan
 | doi = 10.1016/j.disc.2006.05.021 | doi-access = free
 | issue = 19–20
 | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
 | mr = 2261918
 | pages = 2529–2571
 | title = Classes of perfect graphs
 | volume = 306
 | year = 2006
 | zbl = 1104.05029}}</ref>

<ref name=hr89>{{cite journal
 | last1 = Hoáng | first1 = C. T.
 | last2 = Reed | first2 = B. A. | author2-link = Bruce Reed (mathematician)
 | date = September 1989
 | doi = 10.1002/jgt.3190130407
 | issue = 4
 | journal = Journal of Graph Theory
 | pages = 445–463
 | title = Some classes of perfectly orderable graphs
 | volume = 13}}</ref>

<ref name=jansen-1998>{{cite conference
 | last = Jansen | first = Klaus
 | editor1-last = Lucchesi | editor1-first = Claudio L.
 | editor2-last = Moura | editor2-first = Arnaldo V.
 | contribution = A new characterization for parity graphs and a coloring problem with costs
 | doi = 10.1007/BFb0054326
 | hdl = 11858/00-001M-0000-0014-7BE2-3 | hdl-access = free
 | mr = 1635464
 | pages = 249–260
 | publisher = Springer
 | series = Lecture Notes in Computer Science
 | title = LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings
 | volume = 1380
 | year = 1998
 | isbn = 978-3-540-64275-6
 | zbl = 0910.05028}}</ref>

<ref name=jung-1978>{{cite journal
 | last = Jung | first = H. A.
 | doi = 10.1016/0095-8956(78)90013-8 | doi-access = free
 | issue = 2
 | journal = [[Journal of Combinatorial Theory, Series B]]
 | pages = 125–133
 | title = On a class of posets and the corresponding comparability graphs
 | volume = 24
 | year = 1978
 | zbl = 0382.05045}}</ref>

<ref name=kc-1965>{{cite journal
 | last1 = Kay | first1 = David C.
 | last2 = Chartrand | first2 = Gary | author2-link = Gary Chartrand
 | doi = 10.4153/CJM-1965-034-0
 | journal = [[Canadian Journal of Mathematics]]
 | mr = 0175113
 | pages = 342–346
 | title = A characterization of certain ptolemaic graphs
 | volume = 17
 | year = 1965
 | zbl = 0139.17301| doi-access = free
 }}</ref>

<ref name=klps-2007>{{cite journal
 | last1 = Kolen | first1 = Antoon W. J. | author1-link = Antoon Kolen
 | last2 = Lenstra | first2 = Jan Karel | author2-link = Jan Karel Lenstra
 | last3 = Papadimitriou | first3 = Christos H. | author3-link = Christos Papadimitriou
 | last4 = Spieksma | first4 = Frits C. R.
 | doi = 10.1002/nav.20231
 | issue = 5
 | journal = [[Naval Research Logistics]]
 | mr = 2335544
 | pages = 530–543
 | title = Interval scheduling: a survey
 | volume = 54
 | year = 2007
 | zbl = 1143.90337| doi-access = free
 }}</ref>

<ref name=konig-1916>{{cite journal
 | last = Kőnig | first = Dénes | author-link = Dénes Kőnig
 | doi = 10.1007/BF01456961
 | jfm = 46.0146.03
 | journal = [[Mathematische Annalen]]
 | mr = 1511872
 | pages = 453–465
 | title = Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre
 | volume = 77
 | year = 1916| issue = 4 | s2cid = 121097364 | url = https://zenodo.org/record/2395248 }}</ref>

<ref name=konig-1931>{{cite journal
 | last = Kőnig | first = Dénes | author-link = Dénes Kőnig
 | journal = Matematikai és Fizikai Lapok
 | pages = 116–119
 | title = Gráfok és mátrixok
 | volume = 38
 | year = 1931}}</ref>

<ref name=lovasz-1972a>{{cite journal
 | last = Lovász | first = László | author-link = László Lovász
 | doi = 10.1016/0012-365X(72)90006-4 | doi-access = 
 | issue = 3
 | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
 | mr = 0302480
 | pages = 253–267
 | ref = none
 | title = Normal hypergraphs and the perfect graph conjecture
 | volume = 2
 | year = 1972
 | zbl = 0239.05111}}</ref>

<ref name=lovasz-1972b>{{cite journal
 | 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]]
 | mr = 0309780
 | pages = 95–98
 | ref = none
 | series = Series B
 | title = A characterization of perfect graphs
 | volume = 13
 | year = 1972
 | zbl = 0241.05107}}</ref>

<ref name=lovasz-1983>{{cite conference
  | author = Lovász, László
  | author-link = László Lovász
  | year = 1983
  | title = Perfect graphs
  |editor1=Beineke, Lowell W. |editor2=Wilson, Robin J. | book-title = Selected Topics in Graph Theory, Vol. 2
  | pages = 55–87
  | publisher = Academic Press
  | isbn = 0-12-086202-6}}</ref>

<ref name=mackenzie-2002>{{cite journal
 | 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| s2cid = 116891342
 }}</ref>

<ref name=mirsky-1971>{{cite journal
 | last = Mirsky | first = Leon | author-link = Leon Mirsky
 | doi = 10.2307/2316481
 | issue = 8
 | journal = [[The American Mathematical Monthly]]
 | jstor = 2316481
 | mr = 0288054
 | pages = 876–877
 | title = A dual of Dilworth's decomposition theorem
 | volume = 78
 | year = 1971
 | zbl = 0263.06002}}</ref>

<ref name=my-2019>{{cite journal
 | last1 = McDiarmid | first1 = Colin
 | last2 = Yolov | first2 = Nikola
 | arxiv = 1604.00890
 | doi = 10.1002/rsa.20770
 | issue = 1
 | journal = Random Structures & Algorithms
 | mr = 3884617
 | pages = 148–186
 | title = Random perfect graphs
 | volume = 54
 | year = 2019
 | zbl = 1405.05165| s2cid = 53489550
 }}</ref>

<ref name=padberg>{{cite journal
 | last = Padberg | first = Manfred W.
 | date = December 1974
 | doi = 10.1007/bf01580235
 | issue = 1
 | journal = [[Mathematical Programming]]
 | pages = 180–196
 | title = Perfect zero-one matrices
 | volume = 6| url = https://hal.inria.fr/inria-00076517/file/RR-0044.pdf
 }} For the relation between the strong perfect graph theorem and the product characterization of perfect graphs, see remarks preceding Theorem 2.1 and following Theorem 2.2.</ref>

<ref name=perfect-1980>{{cite journal
 | last = Perfect | first = Hazel | author-link = Hazel Perfect
 | doi = 10.1017/S0017089500003931
 | issue = 1
 | journal = [[Glasgow Mathematical Journal]]
 | mr = 558270
 | pages = 19–22
 | title = Remarks on Dilworth's theorem in relation to transversal theory
 | volume = 21
 | year = 1980
 | zbl = 0428.06001| doi-access = free
 }}</ref>

<ref name=ple-1971>{{cite journal
 | last1 = Pnueli | first1 = A. | author1-link = Amir Pnueli
 | last2 = Lempel | first2 = A. | author2-link = Abraham Lempel
 | last3 = Even | first3 = S. | author3-link = Shimon Even
 | doi = 10.4153/CJM-1971-016-5
 | journal = [[Canadian Journal of Mathematics]]
 | mr = 292717
 | pages = 160–175
 | title = Transitive orientation of graphs and identification of permutation graphs
 | volume = 23
 | year = 1971
 | zbl = 0204.24604| doi-access = free
 }}</ref>

<ref name=ps-1992>{{cite journal
 | last1 = Prömel | first1 = Hans Jürgen
 | last2 = Steger | first2 = Angelika | author2-link = Angelika Steger
 | doi = 10.1017/S0963548300000079
 | issue = 1
 | journal = [[Combinatorics, Probability and Computing]]
 | mr = 1167295
 | pages = 53–79
 | title = Almost all Berge graphs are perfect
 | volume = 1
 | year = 1992
 | zbl = 0793.05063| s2cid = 28696495
 }}</ref>

<ref name=roberts-1969>{{cite conference
 | last = Roberts | first = Fred S. | authorlink = Fred S. Roberts
 | contribution = Indifference graphs
 | mr = 0252267
 | pages = 139–146
 | publisher = Academic Press | location = New York
 | title = Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich., 1968)
 | year = 1969
 | zbl = 0193.24205}}</ref>

<ref name=rose>{{cite journal
 | last = Rose | first = Donald J.
 | date = December 1970
 | doi = 10.1016/0022-247x(70)90282-9
 | issue = 3
 | journal = Journal of Mathematical Analysis and Applications
 | pages = 597–609
 | title = Triangulated graphs and the elimination process
 | volume = 32}}</ref>

<ref name=skrien-1982>{{cite journal
 | last = Skrien | first = Dale J.
 | doi = 10.1002/jgt.3190060307
 | issue = 3
 | journal = [[Journal of Graph Theory]]
 | mr = 666799
 | pages = 309–316
 | title = A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
 | volume = 6
 | year = 1982
 | zbl = 0495.05027}}</ref>

<ref name=splittance>{{cite journal
 | last1 = Hammer | first1 = Peter L.
 | last2 = Simeone | first2 = Bruno
 | doi = 10.1007/BF02579333
 | issue = 3
 | journal = [[Combinatorica]]
 | mr = 637832
 | pages = 275–284
 | title = The splittance of a graph
 | volume = 1
 | year = 1981}}</ref>

<ref name=threshold>{{cite web|url=https://www.graphclasses.org/classes/gc_328.html|title=Threshold graphs|work=Information System on Graph Classes and their Inclusions|access-date=2023-02-12}}</ref>

<ref name=trotter-1977>{{cite journal
 | last = Trotter | first = L. E. Jr.
 | doi = 10.1007/BF01593791
 | issue = 2
 | journal = [[Mathematical Programming]]
 | mr = 0457293
 | pages = 255–259
 | title = Line perfect graphs
 | volume = 12
 | year = 1977
 | zbl = 0366.05043| s2cid = 38906333
 }}</ref>

}}