Perfect graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Perfect graph" in English language version.

refsWebsite

Global rank English rank

43doi.org

2^nd place

39ams.org

451^st place

277^th place

33zbmath.org

1,923^rd place

1,068^th place

10semanticscholar.org

11^th place

8^th place

3arxiv.org

69^th place

59^th place

2mathopt.org

low place

2graphclasses.org

low place

2princeton.edu

741^st place

577^th place

1gatech.edu

4,448^th place

2,923^rd place

1inria.fr

4,903^rd place

3,679^th place

1nih.gov

4^th place

1zenodo.org

621^st place

380^th place

1jstor.org

26^th place

20^th place

1uib.no

4,170^th place

3,980^th place

1handle.net

102^nd place

76^th place

1cwi.nl

low place

1mtak.hu

low place

9,835^th place

ams.org

mathscinet.ams.org

Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2003). "Progress on perfect graphs" (PDF). Mathematical Programming. 97 (1-2(B)): 405–422. doi:10.1007/s10107-003-0449-8. MR 2004404. S2CID 5226655. Zbl 1028.05035.
Lovász, László (1972). "Normal hypergraphs and the perfect graph conjecture". Discrete Mathematics. 2 (3): 253–267. doi:10.1016/0012-365X(72)90006-4. MR 0302480. Zbl 0239.05111.
Cornuéjols, Gérard (2002). "The strong perfect graph conjecture". Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002). Beijing: Higher Education Press. pp. 547–559. arXiv:math/0304464. MR 1957560. Zbl 1004.05034.
Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006). "The strong perfect graph theorem". Annals of Mathematics. 164 (1): 51–229. arXiv:math/0212070. doi:10.4007/annals.2006.164.51. MR 2233847. S2CID 119151552. Zbl 1112.05042.
Lovász, László (1972). "A characterization of perfect graphs". Journal of Combinatorial Theory. Series B. 13 (2): 95–98. doi:10.1016/0095-8956(72)90045-7. MR 0309780. Zbl 0241.05107.
Gallai, Tibor (1958). "Maximum-minimum Sätze über Graphen". Acta Mathematica Academiae Scientiarum Hungaricae. 9 (3–4): 395–434. doi:10.1007/BF02020271. MR 0124238. S2CID 123953062. Zbl 0084.19603.
Hougardy, Stefan (2006). "Classes of perfect graphs". Discrete Mathematics. 306 (19–20): 2529–2571. doi:10.1016/j.disc.2006.05.021. MR 2261918. Zbl 1104.05029.
Chudnovsky, Maria; Seymour, Paul (2005). "The structure of claw-free graphs" (PDF). Surveys in combinatorics 2005. Papers from the 20th British combinatorial conference, University of Durham, Durham, UK, July 10–15, 2005. Cambridge University Press. pp. 153–171. ISBN 0-521-61523-2. MR 2187738. Zbl 1109.05092.
Trotter, L. E. Jr. (1977). "Line perfect graphs". Mathematical Programming. 12 (2): 255–259. doi:10.1007/BF01593791. MR 0457293. S2CID 38906333. Zbl 0366.05043.
Boros, E.; Gurvich, V. (2006). "Perfect graphs, kernels, and cores of cooperative games". Discrete Mathematics. 306 (19–20): 2336–2354. doi:10.1016/j.disc.2005.12.031. MR 2261906. Zbl 1103.05034.
Kőnig, Dénes (1916). "Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre". Mathematische Annalen. 77 (4): 453–465. doi:10.1007/BF01456961. JFM 46.0146.03. MR 1511872. S2CID 121097364.
Harzheim, Egbert (2005). "Comparability graphs". Ordered Sets. Advances in Mathematics. Vol. 7. New York: Springer. pp. 353–368. doi:10.1007/0-387-24222-8_12. ISBN 0-387-24219-8. MR 2127991. Zbl 1072.06001.
Berge, Claude (1967). "Some classes of perfect graphs". Graph Theory and Theoretical Physics. London: Academic Press. pp. 155–165. MR 0232694. Zbl 0203.26403.
Mirsky, Leon (1971). "A dual of Dilworth's decomposition theorem". The American Mathematical Monthly. 78 (8): 876–877. doi:10.2307/2316481. JSTOR 2316481. MR 0288054. Zbl 0263.06002.
Perfect, Hazel (1980). "Remarks on Dilworth's theorem in relation to transversal theory". Glasgow Mathematical Journal. 21 (1): 19–22. doi:10.1017/S0017089500003931. MR 0558270. Zbl 0428.06001.
Pnueli, A.; Lempel, A.; Even, S. (1971). "Transitive orientation of graphs and identification of permutation graphs". Canadian Journal of Mathematics. 23: 160–175. doi:10.4153/CJM-1971-016-5. MR 0292717. Zbl 0204.24604.
Kolen, Antoon W. J.; Lenstra, Jan Karel; Papadimitriou, Christos H.; Spieksma, Frits C. R. (2007). "Interval scheduling: a survey". Naval Research Logistics. 54 (5): 530–543. doi:10.1002/nav.20231. MR 2335544. Zbl 1143.90337.
Dagan, Ido; Golumbic, Martin Charles; Pinter, Ron Yair (1988). "Trapezoid graphs and their coloring". Discrete Applied Mathematics. 21 (1): 35–46. doi:10.1016/0166-218X(88)90032-7. MR 0953414. Zbl 0658.05067.
Roberts, Fred S. (1969). "Indifference graphs". Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich., 1968). New York: Academic Press. pp. 139–146. MR 0252267. Zbl 0193.24205.
Skrien, Dale J. (1982). "A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs". Journal of Graph Theory. 6 (3): 309–316. doi:10.1002/jgt.3190060307. MR 0666799. Zbl 0495.05027.
Golumbic, Martin Charles (1978). "Trivially perfect graphs". Discrete Mathematics. 24 (1): 105–107. doi:10.1016/0012-365X(78)90178-4. MR 0522739. Zbl 0384.05057.
Hammer, Peter L.; Simeone, Bruno (1981). "The splittance of a graph". Combinatorica. 1 (3): 275–284. doi:10.1007/BF02579333. MR 0637832.
Prömel, Hans Jürgen; Steger, Angelika (1992). "Almost all Berge graphs are perfect". Combinatorics, Probability and Computing. 1 (1): 53–79. doi:10.1017/S0963548300000079. MR 1167295. S2CID 28696495. Zbl 0793.05063.
McDiarmid, Colin; Yolov, Nikola (2019). "Random perfect graphs". Random Structures & Algorithms. 54 (1): 148–186. arXiv:1604.00890. doi:10.1002/rsa.20770. MR 3884617. S2CID 53489550. Zbl 1405.05165.
Dirac, G. A. (1961). "On rigid circuit graphs". Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 25 (1–2): 71–76. doi:10.1007/BF02992776. MR 0130190. S2CID 120608513.
Földes, Stéphane; Hammer, Peter Ladislaw (1977). "Split graphs". Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La., 1977). Congressus Numerantium. Vol. XIX. Winnipeg: Utilitas Math. pp. 311–315. MR 0505860.
Bandelt, Hans-Jürgen; Mulder, Henry Martyn (1986). "Distance-hereditary graphs". Journal of Combinatorial Theory. Series B. 41 (2): 182–208. doi:10.1016/0095-8956(86)90043-2. MR 0859310. Zbl 0605.05024.
Corneil, D. G.; Lerchs, H.; Stewart Burlingham, L. (1981). "Complement reducible graphs". Discrete Applied Mathematics. 3 (3): 163–174. doi:10.1016/0166-218X(81)90013-5. MR 0619603. Zbl 0463.05057.
Kay, David C.; Chartrand, Gary (1965). "A characterization of certain ptolemaic graphs". Canadian Journal of Mathematics. 17: 342–346. doi:10.4153/CJM-1965-034-0. MR 0175113. Zbl 0139.17301.
Heggernes, Pinar; Kratsch, Dieter (2007). "Linear-time certifying recognition algorithms and forbidden induced subgraphs" (PDF). Nordic Journal of Computing. 14 (1–2): 87–108 (2008). MR 2460558. Zbl 1169.68653.
Golumbic, Martin Charles; Trenk, Ann N. (2004). Tolerance graphs. Cambridge Studies in Advanced Mathematics. Vol. 89. Cambridge University Press. doi:10.1017/CBO9780511542985. ISBN 0-521-82758-2. MR 2051713.
Hoàng, C. T. (1987). "On a conjecture of Meyniel". Journal of Combinatorial Theory, Series B. 42 (3): 302–312. doi:10.1016/0095-8956(87)90047-5. MR 0888682. Zbl 0634.05058.
Cicerone, Serafino; Di Stefano, Gabriele (1999). "Graph classes between parity and distance-hereditary graphs". Discrete Applied Mathematics. 95 (1–3): 197–216. doi:10.1016/S0166-218X(99)00075-X. MR 1708837. Zbl 0933.05144.
Jansen, Klaus (1998). "A new characterization for parity graphs and a coloring problem with costs". In Lucchesi, Claudio L.; Moura, Arnaldo V. (eds.). LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings. Lecture Notes in Computer Science. Vol. 1380. Springer. pp. 249–260. doi:10.1007/BFb0054326. hdl:11858/00-001M-0000-0014-7BE2-3. ISBN 978-3-540-64275-6. MR 1635464. Zbl 0910.05028.
Chvátal, Václav (1975). "On certain polytopes associated with graphs". Journal of Combinatorial Theory, Series B. 18 (2): 138–154. doi:10.1016/0095-8956(75)90041-6. MR 0371732. Zbl 0277.05139.
Grötschel, Martin; Lovász, László; Schrijver, Alexander (1984). "Polynomial algorithms for perfect graphs". In Berge, C.; Chvátal, V. (eds.). Topics on perfect graphs. North-Holland Mathematics Studies. Vol. 88. North-Holland, Amsterdam. pp. 325–356. doi:10.1016/S0304-0208(08)72943-8. ISBN 978-0-444-86587-8. MR 0778770.
Grötschel, Martin; Lovász, László; Schrijver, Alexander (1988). Geometric Algorithms and Combinatorial Optimization. Springer-Verlag. MR 0936633. Zbl 0634.05001. See especially chapter 9, "Stable Sets in Graphs", pp. 273–303.
Gyárfás, A. (1987). "Problems from the world surrounding perfect graphs" (PDF). Proceedings of the International Conference on Combinatorial Analysis and its Applications (Pokrzywna, 1985). Zastosowania Matematyki. 19 (3–4): 413–441 (1988). MR 0951359.
Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997). "Claw-free graphs — A survey". Discrete Mathematics. 164 (1–3): 87–147. doi:10.1016/S0012-365X(96)00045-3. MR 1432221.

arxiv.org

Cornuéjols, Gérard (2002). "The strong perfect graph conjecture". Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002). Beijing: Higher Education Press. pp. 547–559. arXiv:math/0304464. MR 1957560. Zbl 1004.05034.
Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006). "The strong perfect graph theorem". Annals of Mathematics. 164 (1): 51–229. arXiv:math/0212070. doi:10.4007/annals.2006.164.51. MR 2233847. S2CID 119151552. Zbl 1112.05042.
McDiarmid, Colin; Yolov, Nikola (2019). "Random perfect graphs". Random Structures & Algorithms. 54 (1): 148–186. arXiv:1604.00890. doi:10.1002/rsa.20770. MR 3884617. S2CID 53489550. Zbl 1405.05165.

cwi.nl

ir.cwi.nl

Grötschel, Martin; Lovász, László; Schrijver, Alexander (1984). "Polynomial algorithms for perfect graphs". In Berge, C.; Chvátal, V. (eds.). Topics on perfect graphs. North-Holland Mathematics Studies. Vol. 88. North-Holland, Amsterdam. pp. 325–356. doi:10.1016/S0304-0208(08)72943-8. ISBN 978-0-444-86587-8. MR 0778770.

doi.org

Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2003). "Progress on perfect graphs" (PDF). Mathematical Programming. 97 (1-2(B)): 405–422. doi:10.1007/s10107-003-0449-8. MR 2004404. S2CID 5226655. Zbl 1028.05035.
Lovász, László (1972). "Normal hypergraphs and the perfect graph conjecture". Discrete Mathematics. 2 (3): 253–267. doi:10.1016/0012-365X(72)90006-4. MR 0302480. Zbl 0239.05111.
Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006). "The strong perfect graph theorem". Annals of Mathematics. 164 (1): 51–229. arXiv:math/0212070. doi:10.4007/annals.2006.164.51. MR 2233847. S2CID 119151552. Zbl 1112.05042.
Lovász, László (1972). "A characterization of perfect graphs". Journal of Combinatorial Theory. Series B. 13 (2): 95–98. doi:10.1016/0095-8956(72)90045-7. MR 0309780. Zbl 0241.05107.
Gasparian, G. S. (June 1996). "Minimal imperfect graphs: A simple approach". Combinatorica. 16 (2): 209–212. doi:10.1007/bf01844846.
Padberg, Manfred W. (December 1974). "Perfect zero-one matrices" (PDF). Mathematical Programming. 6 (1): 180–196. doi:10.1007/bf01580235. 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.
Gallai, Tibor (1958). "Maximum-minimum Sätze über Graphen". Acta Mathematica Academiae Scientiarum Hungaricae. 9 (3–4): 395–434. doi:10.1007/BF02020271. MR 0124238. S2CID 123953062. Zbl 0084.19603.
Hougardy, Stefan (2006). "Classes of perfect graphs". Discrete Mathematics. 306 (19–20): 2529–2571. doi:10.1016/j.disc.2006.05.021. MR 2261918. Zbl 1104.05029.
Mackenzie, Dana (July 5, 2002). "Mathematics: Graph theory uncovers the roots of perfection". Science. 297 (5578): 38. doi:10.1126/science.297.5578.38. PMID 12098683. S2CID 116891342.
Trotter, L. E. Jr. (1977). "Line perfect graphs". Mathematical Programming. 12 (2): 255–259. doi:10.1007/BF01593791. MR 0457293. S2CID 38906333. Zbl 0366.05043.
Boros, E.; Gurvich, V. (2006). "Perfect graphs, kernels, and cores of cooperative games". Discrete Mathematics. 306 (19–20): 2336–2354. doi:10.1016/j.disc.2005.12.031. MR 2261906. Zbl 1103.05034.
Kőnig, Dénes (1916). "Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre". Mathematische Annalen. 77 (4): 453–465. doi:10.1007/BF01456961. JFM 46.0146.03. MR 1511872. S2CID 121097364.
Harzheim, Egbert (2005). "Comparability graphs". Ordered Sets. Advances in Mathematics. Vol. 7. New York: Springer. pp. 353–368. doi:10.1007/0-387-24222-8_12. ISBN 0-387-24219-8. MR 2127991. Zbl 1072.06001.
Mirsky, Leon (1971). "A dual of Dilworth's decomposition theorem". The American Mathematical Monthly. 78 (8): 876–877. doi:10.2307/2316481. JSTOR 2316481. MR 0288054. Zbl 0263.06002.
Perfect, Hazel (1980). "Remarks on Dilworth's theorem in relation to transversal theory". Glasgow Mathematical Journal. 21 (1): 19–22. doi:10.1017/S0017089500003931. MR 0558270. Zbl 0428.06001.
Pnueli, A.; Lempel, A.; Even, S. (1971). "Transitive orientation of graphs and identification of permutation graphs". Canadian Journal of Mathematics. 23: 160–175. doi:10.4153/CJM-1971-016-5. MR 0292717. Zbl 0204.24604.
Kolen, Antoon W. J.; Lenstra, Jan Karel; Papadimitriou, Christos H.; Spieksma, Frits C. R. (2007). "Interval scheduling: a survey". Naval Research Logistics. 54 (5): 530–543. doi:10.1002/nav.20231. MR 2335544. Zbl 1143.90337.
Dagan, Ido; Golumbic, Martin Charles; Pinter, Ron Yair (1988). "Trapezoid graphs and their coloring". Discrete Applied Mathematics. 21 (1): 35–46. doi:10.1016/0166-218X(88)90032-7. MR 0953414. Zbl 0658.05067.
Skrien, Dale J. (1982). "A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs". Journal of Graph Theory. 6 (3): 309–316. doi:10.1002/jgt.3190060307. MR 0666799. Zbl 0495.05027.
Golumbic, Martin Charles (1978). "Trivially perfect graphs". Discrete Mathematics. 24 (1): 105–107. doi:10.1016/0012-365X(78)90178-4. MR 0522739. Zbl 0384.05057.
Hammer, Peter L.; Simeone, Bruno (1981). "The splittance of a graph". Combinatorica. 1 (3): 275–284. doi:10.1007/BF02579333. MR 0637832.
Prömel, Hans Jürgen; Steger, Angelika (1992). "Almost all Berge graphs are perfect". Combinatorics, Probability and Computing. 1 (1): 53–79. doi:10.1017/S0963548300000079. MR 1167295. S2CID 28696495. Zbl 0793.05063.
McDiarmid, Colin; Yolov, Nikola (2019). "Random perfect graphs". Random Structures & Algorithms. 54 (1): 148–186. arXiv:1604.00890. doi:10.1002/rsa.20770. MR 3884617. S2CID 53489550. Zbl 1405.05165.
Rose, Donald J. (December 1970). "Triangulated graphs and the elimination process". Journal of Mathematical Analysis and Applications. 32 (3): 597–609. doi:10.1016/0022-247x(70)90282-9.
Dirac, G. A. (1961). "On rigid circuit graphs". Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 25 (1–2): 71–76. doi:10.1007/BF02992776. MR 0130190. S2CID 120608513.
Harary, Frank (1974). "Recent results on trees". In Bari, Ruth A.; Harary, Frank (eds.). Graphs and Combinatorics: Proceedings of the Capital Conference on Graph Theory and Combinatorics at the George Washington University, June 18–22, 1973. Lecture Notes in Mathematics. Vol. 406. Springer. pp. 1–9. doi:10.1007/bfb0066429. ISBN 9783540378099.
Bandelt, Hans-Jürgen; Mulder, Henry Martyn (1986). "Distance-hereditary graphs". Journal of Combinatorial Theory. Series B. 41 (2): 182–208. doi:10.1016/0095-8956(86)90043-2. MR 0859310. Zbl 0605.05024.
Jung, H. A. (1978). "On a class of posets and the corresponding comparability graphs". Journal of Combinatorial Theory, Series B. 24 (2): 125–133. doi:10.1016/0095-8956(78)90013-8. Zbl 0382.05045.
Corneil, D. G.; Lerchs, H.; Stewart Burlingham, L. (1981). "Complement reducible graphs". Discrete Applied Mathematics. 3 (3): 163–174. doi:10.1016/0166-218X(81)90013-5. MR 0619603. Zbl 0463.05057.
Kay, David C.; Chartrand, Gary (1965). "A characterization of certain ptolemaic graphs". Canadian Journal of Mathematics. 17: 342–346. doi:10.4153/CJM-1965-034-0. MR 0175113. Zbl 0139.17301.
Gavril, Fanica (1972). "Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph". SIAM Journal on Computing. 1 (2): 180–187. doi:10.1137/0201013.
Hammer, Peter L.; Maffray, Frédéric (1990). "Completely separable graphs". Discrete Applied Mathematics. 27 (1–2): 85–99. doi:10.1016/0166-218x(90)90131-u.
Hoáng, C. T.; Reed, B. A. (September 1989). "Some classes of perfectly orderable graphs". Journal of Graph Theory. 13 (4): 445–463. doi:10.1002/jgt.3190130407.
Gyárfás, A.; Lehel, J. (June 1988). "On-line and first fit colorings of graphs". Journal of Graph Theory. 12 (2): 217–227. doi:10.1002/jgt.3190120212.
Golumbic, Martin Charles; Trenk, Ann N. (2004). Tolerance graphs. Cambridge Studies in Advanced Mathematics. Vol. 89. Cambridge University Press. doi:10.1017/CBO9780511542985. ISBN 0-521-82758-2. MR 2051713.
Hoàng, C. T. (1987). "On a conjecture of Meyniel". Journal of Combinatorial Theory, Series B. 42 (3): 302–312. doi:10.1016/0095-8956(87)90047-5. MR 0888682. Zbl 0634.05058.
Cicerone, Serafino; Di Stefano, Gabriele (1999). "Graph classes between parity and distance-hereditary graphs". Discrete Applied Mathematics. 95 (1–3): 197–216. doi:10.1016/S0166-218X(99)00075-X. MR 1708837. Zbl 0933.05144.
Jansen, Klaus (1998). "A new characterization for parity graphs and a coloring problem with costs". In Lucchesi, Claudio L.; Moura, Arnaldo V. (eds.). LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings. Lecture Notes in Computer Science. Vol. 1380. Springer. pp. 249–260. doi:10.1007/BFb0054326. hdl:11858/00-001M-0000-0014-7BE2-3. ISBN 978-3-540-64275-6. MR 1635464. Zbl 0910.05028.
Chvátal, Václav (1975). "On certain polytopes associated with graphs". Journal of Combinatorial Theory, Series B. 18 (2): 138–154. doi:10.1016/0095-8956(75)90041-6. MR 0371732. Zbl 0277.05139.
Grötschel, Martin; Lovász, László; Schrijver, Alexander (1984). "Polynomial algorithms for perfect graphs". In Berge, C.; Chvátal, V. (eds.). Topics on perfect graphs. North-Holland Mathematics Studies. Vol. 88. North-Holland, Amsterdam. pp. 325–356. doi:10.1016/S0304-0208(08)72943-8. ISBN 978-0-444-86587-8. MR 0778770.
Golumbic, Martin Charles (1980). Algorithmic Graph Theory and Perfect Graphs. Academic Press. doi:10.1016/C2013-0-10739-8. ISBN 0-444-51530-5. Second edition, Annals of Discrete Mathematics 57, Elsevier, 2004.
Chudnovsky, Maria; Cornuéjols, Gérard; Liu, Xinming; Seymour, Paul; Vušković, Kristina (2005). "Recognizing Berge graphs". Combinatorica. 25 (2): 143–186. doi:10.1007/s00493-005-0012-8. S2CID 2229369.
Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk (1997). "Claw-free graphs — A survey". Discrete Mathematics. 164 (1–3): 87–147. doi:10.1016/S0012-365X(96)00045-3. MR 1432221.

gatech.edu

thomas.math.gatech.edu

Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2003). "Progress on perfect graphs" (PDF). Mathematical Programming. 97 (1-2(B)): 405–422. doi:10.1007/s10107-003-0449-8. MR 2004404. S2CID 5226655. Zbl 1028.05035.

graphclasses.org

"Bipartite graphs". Information System on Graph Classes and their Inclusions. Retrieved 2023-01-24.
"Threshold graphs". Information System on Graph Classes and their Inclusions. Retrieved 2023-02-12.

handle.net

hdl.handle.net

Jansen, Klaus (1998). "A new characterization for parity graphs and a coloring problem with costs". In Lucchesi, Claudio L.; Moura, Arnaldo V. (eds.). LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings. Lecture Notes in Computer Science. Vol. 1380. Springer. pp. 249–260. doi:10.1007/BFb0054326. hdl:11858/00-001M-0000-0014-7BE2-3. ISBN 978-3-540-64275-6. MR 1635464. Zbl 0910.05028.

inria.fr

hal.inria.fr

Padberg, Manfred W. (December 1974). "Perfect zero-one matrices" (PDF). Mathematical Programming. 6 (1): 180–196. doi:10.1007/bf01580235. 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.

jstor.org

Mirsky, Leon (1971). "A dual of Dilworth's decomposition theorem". The American Mathematical Monthly. 78 (8): 876–877. doi:10.2307/2316481. JSTOR 2316481. MR 0288054. Zbl 0263.06002.

mathopt.org

"The 1991 D. R. Fulkerson Prizes in Discrete Mathematics" (PDF). 1991 Prize Recipients. Optima: Mathematical Optimization Society Newsletter (35): 4–8. November 1991. Retrieved 2023-01-21.
"2009 Fulkerson Prize Citation". Mathematical Optimization Society. Retrieved 2023-01-21.

mtak.hu

real-eod.mtak.hu

Gyárfás, A. (1987). "Problems from the world surrounding perfect graphs" (PDF). Proceedings of the International Conference on Combinatorial Analysis and its Applications (Pokrzywna, 1985). Zastosowania Matematyki. 19 (3–4): 413–441 (1988). MR 0951359.

nih.gov

pubmed.ncbi.nlm.nih.gov

Mackenzie, Dana (July 5, 2002). "Mathematics: Graph theory uncovers the roots of perfection". Science. 297 (5578): 38. doi:10.1126/science.297.5578.38. PMID 12098683. S2CID 116891342.

princeton.edu

annals.princeton.edu

Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006). "The strong perfect graph theorem". Annals of Mathematics. 164 (1): 51–229. arXiv:math/0212070. doi:10.4007/annals.2006.164.51. MR 2233847. S2CID 119151552. Zbl 1112.05042.

web.math.princeton.edu

Chudnovsky, Maria; Seymour, Paul (2005). "The structure of claw-free graphs" (PDF). Surveys in combinatorics 2005. Papers from the 20th British combinatorial conference, University of Durham, Durham, UK, July 10–15, 2005. Cambridge University Press. pp. 153–171. ISBN 0-521-61523-2. MR 2187738. Zbl 1109.05092.

semanticscholar.org

api.semanticscholar.org

Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2003). "Progress on perfect graphs" (PDF). Mathematical Programming. 97 (1-2(B)): 405–422. doi:10.1007/s10107-003-0449-8. MR 2004404. S2CID 5226655. Zbl 1028.05035.
Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006). "The strong perfect graph theorem". Annals of Mathematics. 164 (1): 51–229. arXiv:math/0212070. doi:10.4007/annals.2006.164.51. MR 2233847. S2CID 119151552. Zbl 1112.05042.
Gallai, Tibor (1958). "Maximum-minimum Sätze über Graphen". Acta Mathematica Academiae Scientiarum Hungaricae. 9 (3–4): 395–434. doi:10.1007/BF02020271. MR 0124238. S2CID 123953062. Zbl 0084.19603.
Mackenzie, Dana (July 5, 2002). "Mathematics: Graph theory uncovers the roots of perfection". Science. 297 (5578): 38. doi:10.1126/science.297.5578.38. PMID 12098683. S2CID 116891342.
Trotter, L. E. Jr. (1977). "Line perfect graphs". Mathematical Programming. 12 (2): 255–259. doi:10.1007/BF01593791. MR 0457293. S2CID 38906333. Zbl 0366.05043.
Kőnig, Dénes (1916). "Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre". Mathematische Annalen. 77 (4): 453–465. doi:10.1007/BF01456961. JFM 46.0146.03. MR 1511872. S2CID 121097364.
Prömel, Hans Jürgen; Steger, Angelika (1992). "Almost all Berge graphs are perfect". Combinatorics, Probability and Computing. 1 (1): 53–79. doi:10.1017/S0963548300000079. MR 1167295. S2CID 28696495. Zbl 0793.05063.
McDiarmid, Colin; Yolov, Nikola (2019). "Random perfect graphs". Random Structures & Algorithms. 54 (1): 148–186. arXiv:1604.00890. doi:10.1002/rsa.20770. MR 3884617. S2CID 53489550. Zbl 1405.05165.
Dirac, G. A. (1961). "On rigid circuit graphs". Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 25 (1–2): 71–76. doi:10.1007/BF02992776. MR 0130190. S2CID 120608513.
Chudnovsky, Maria; Cornuéjols, Gérard; Liu, Xinming; Seymour, Paul; Vušković, Kristina (2005). "Recognizing Berge graphs". Combinatorica. 25 (2): 143–186. doi:10.1007/s00493-005-0012-8. S2CID 2229369.

uib.no

ii.uib.no

Heggernes, Pinar; Kratsch, Dieter (2007). "Linear-time certifying recognition algorithms and forbidden induced subgraphs" (PDF). Nordic Journal of Computing. 14 (1–2): 87–108 (2008). MR 2460558. Zbl 1169.68653.

zbmath.org

Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2003). "Progress on perfect graphs" (PDF). Mathematical Programming. 97 (1-2(B)): 405–422. doi:10.1007/s10107-003-0449-8. MR 2004404. S2CID 5226655. Zbl 1028.05035.
Lovász, László (1972). "Normal hypergraphs and the perfect graph conjecture". Discrete Mathematics. 2 (3): 253–267. doi:10.1016/0012-365X(72)90006-4. MR 0302480. Zbl 0239.05111.
Cornuéjols, Gérard (2002). "The strong perfect graph conjecture". Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002). Beijing: Higher Education Press. pp. 547–559. arXiv:math/0304464. MR 1957560. Zbl 1004.05034.
Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006). "The strong perfect graph theorem". Annals of Mathematics. 164 (1): 51–229. arXiv:math/0212070. doi:10.4007/annals.2006.164.51. MR 2233847. S2CID 119151552. Zbl 1112.05042.
Lovász, László (1972). "A characterization of perfect graphs". Journal of Combinatorial Theory. Series B. 13 (2): 95–98. doi:10.1016/0095-8956(72)90045-7. MR 0309780. Zbl 0241.05107.
Gallai, Tibor (1958). "Maximum-minimum Sätze über Graphen". Acta Mathematica Academiae Scientiarum Hungaricae. 9 (3–4): 395–434. doi:10.1007/BF02020271. MR 0124238. S2CID 123953062. Zbl 0084.19603.
Hougardy, Stefan (2006). "Classes of perfect graphs". Discrete Mathematics. 306 (19–20): 2529–2571. doi:10.1016/j.disc.2006.05.021. MR 2261918. Zbl 1104.05029.
Chudnovsky, Maria; Seymour, Paul (2005). "The structure of claw-free graphs" (PDF). Surveys in combinatorics 2005. Papers from the 20th British combinatorial conference, University of Durham, Durham, UK, July 10–15, 2005. Cambridge University Press. pp. 153–171. ISBN 0-521-61523-2. MR 2187738. Zbl 1109.05092.
Trotter, L. E. Jr. (1977). "Line perfect graphs". Mathematical Programming. 12 (2): 255–259. doi:10.1007/BF01593791. MR 0457293. S2CID 38906333. Zbl 0366.05043.
Boros, E.; Gurvich, V. (2006). "Perfect graphs, kernels, and cores of cooperative games". Discrete Mathematics. 306 (19–20): 2336–2354. doi:10.1016/j.disc.2005.12.031. MR 2261906. Zbl 1103.05034.
Kőnig, Dénes (1916). "Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre". Mathematische Annalen. 77 (4): 453–465. doi:10.1007/BF01456961. JFM 46.0146.03. MR 1511872. S2CID 121097364.
Harzheim, Egbert (2005). "Comparability graphs". Ordered Sets. Advances in Mathematics. Vol. 7. New York: Springer. pp. 353–368. doi:10.1007/0-387-24222-8_12. ISBN 0-387-24219-8. MR 2127991. Zbl 1072.06001.
Berge, Claude (1967). "Some classes of perfect graphs". Graph Theory and Theoretical Physics. London: Academic Press. pp. 155–165. MR 0232694. Zbl 0203.26403.
Mirsky, Leon (1971). "A dual of Dilworth's decomposition theorem". The American Mathematical Monthly. 78 (8): 876–877. doi:10.2307/2316481. JSTOR 2316481. MR 0288054. Zbl 0263.06002.
Perfect, Hazel (1980). "Remarks on Dilworth's theorem in relation to transversal theory". Glasgow Mathematical Journal. 21 (1): 19–22. doi:10.1017/S0017089500003931. MR 0558270. Zbl 0428.06001.
Pnueli, A.; Lempel, A.; Even, S. (1971). "Transitive orientation of graphs and identification of permutation graphs". Canadian Journal of Mathematics. 23: 160–175. doi:10.4153/CJM-1971-016-5. MR 0292717. Zbl 0204.24604.
Kolen, Antoon W. J.; Lenstra, Jan Karel; Papadimitriou, Christos H.; Spieksma, Frits C. R. (2007). "Interval scheduling: a survey". Naval Research Logistics. 54 (5): 530–543. doi:10.1002/nav.20231. MR 2335544. Zbl 1143.90337.
Dagan, Ido; Golumbic, Martin Charles; Pinter, Ron Yair (1988). "Trapezoid graphs and their coloring". Discrete Applied Mathematics. 21 (1): 35–46. doi:10.1016/0166-218X(88)90032-7. MR 0953414. Zbl 0658.05067.
Roberts, Fred S. (1969). "Indifference graphs". Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich., 1968). New York: Academic Press. pp. 139–146. MR 0252267. Zbl 0193.24205.
Skrien, Dale J. (1982). "A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs". Journal of Graph Theory. 6 (3): 309–316. doi:10.1002/jgt.3190060307. MR 0666799. Zbl 0495.05027.
Golumbic, Martin Charles (1978). "Trivially perfect graphs". Discrete Mathematics. 24 (1): 105–107. doi:10.1016/0012-365X(78)90178-4. MR 0522739. Zbl 0384.05057.
Prömel, Hans Jürgen; Steger, Angelika (1992). "Almost all Berge graphs are perfect". Combinatorics, Probability and Computing. 1 (1): 53–79. doi:10.1017/S0963548300000079. MR 1167295. S2CID 28696495. Zbl 0793.05063.
McDiarmid, Colin; Yolov, Nikola (2019). "Random perfect graphs". Random Structures & Algorithms. 54 (1): 148–186. arXiv:1604.00890. doi:10.1002/rsa.20770. MR 3884617. S2CID 53489550. Zbl 1405.05165.
Bandelt, Hans-Jürgen; Mulder, Henry Martyn (1986). "Distance-hereditary graphs". Journal of Combinatorial Theory. Series B. 41 (2): 182–208. doi:10.1016/0095-8956(86)90043-2. MR 0859310. Zbl 0605.05024.
Jung, H. A. (1978). "On a class of posets and the corresponding comparability graphs". Journal of Combinatorial Theory, Series B. 24 (2): 125–133. doi:10.1016/0095-8956(78)90013-8. Zbl 0382.05045.
Corneil, D. G.; Lerchs, H.; Stewart Burlingham, L. (1981). "Complement reducible graphs". Discrete Applied Mathematics. 3 (3): 163–174. doi:10.1016/0166-218X(81)90013-5. MR 0619603. Zbl 0463.05057.
Kay, David C.; Chartrand, Gary (1965). "A characterization of certain ptolemaic graphs". Canadian Journal of Mathematics. 17: 342–346. doi:10.4153/CJM-1965-034-0. MR 0175113. Zbl 0139.17301.
Heggernes, Pinar; Kratsch, Dieter (2007). "Linear-time certifying recognition algorithms and forbidden induced subgraphs" (PDF). Nordic Journal of Computing. 14 (1–2): 87–108 (2008). MR 2460558. Zbl 1169.68653.
Hoàng, C. T. (1987). "On a conjecture of Meyniel". Journal of Combinatorial Theory, Series B. 42 (3): 302–312. doi:10.1016/0095-8956(87)90047-5. MR 0888682. Zbl 0634.05058.
Cicerone, Serafino; Di Stefano, Gabriele (1999). "Graph classes between parity and distance-hereditary graphs". Discrete Applied Mathematics. 95 (1–3): 197–216. doi:10.1016/S0166-218X(99)00075-X. MR 1708837. Zbl 0933.05144.
Jansen, Klaus (1998). "A new characterization for parity graphs and a coloring problem with costs". In Lucchesi, Claudio L.; Moura, Arnaldo V. (eds.). LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings. Lecture Notes in Computer Science. Vol. 1380. Springer. pp. 249–260. doi:10.1007/BFb0054326. hdl:11858/00-001M-0000-0014-7BE2-3. ISBN 978-3-540-64275-6. MR 1635464. Zbl 0910.05028.
Chvátal, Václav (1975). "On certain polytopes associated with graphs". Journal of Combinatorial Theory, Series B. 18 (2): 138–154. doi:10.1016/0095-8956(75)90041-6. MR 0371732. Zbl 0277.05139.
Grötschel, Martin; Lovász, László; Schrijver, Alexander (1988). Geometric Algorithms and Combinatorial Optimization. Springer-Verlag. MR 0936633. Zbl 0634.05001. See especially chapter 9, "Stable Sets in Graphs", pp. 273–303.

zenodo.org

Kőnig, Dénes (1916). "Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre". Mathematische Annalen. 77 (4): 453–465. doi:10.1007/BF01456961. JFM 46.0146.03. MR 1511872. S2CID 121097364.