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. MR1957560. Zbl1004.05034.
Berge, Claude (1967). "Some classes of perfect graphs". Graph Theory and Theoretical Physics. London: Academic Press. pp. 155–165. MR0232694. Zbl0203.26403.
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. MR0252267. Zbl0193.24205.
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. MR0505860.
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. ISBN978-3-540-64275-6. MR1635464. Zbl0910.05028.
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. MR1957560. Zbl1004.05034.
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.
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.
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. ISBN9783540378099.
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.
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.
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. ISBN978-3-540-64275-6. MR1635464. Zbl0910.05028.
"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. ISBN978-3-540-64275-6. MR1635464. Zbl0910.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.
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. MR1957560. Zbl1004.05034.
Berge, Claude (1967). "Some classes of perfect graphs". Graph Theory and Theoretical Physics. London: Academic Press. pp. 155–165. MR0232694. Zbl0203.26403.
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. MR0252267. Zbl0193.24205.
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. ISBN978-3-540-64275-6. MR1635464. Zbl0910.05028.