A note on perfect graphs

K. Cameron, J. Edmonds, L. Lovász

Research output: Contribution to journalArticle

22 Citations (Scopus)


Let the lines of a complete graph be 3-colored so that no triangle gets 3 different colors. If two of these colors form perfect graphs then so does the third.

Original languageEnglish
Pages (from-to)173-175
Number of pages3
JournalPeriodica Mathematica Hungarica
Issue number3
Publication statusPublished - Sep 1 1986


  • AMS (MOS) subject classifications (1980): Primary 05C75, Secondary 05C15
  • Perfect graphs
  • complementary graphs
  • perfect graph theorem

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'A note on perfect graphs'. Together they form a unique fingerprint.

  • Cite this