Periodica Mathematica Hungarica

, Volume 17, Issue 3, pp 173–175

A note on perfect graphs

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

DOI: 10.1007/BF01848646

Cite this article as:
Cameron, K., Edmonds, J. & Lovász, L. Period Math Hung (1986) 17: 173. doi:10.1007/BF01848646


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.

AMS (MOS) subject classifications (1980)

Primary 05C75 Secondary 05C15 

Key words and phrases

Perfect graphs complementary graphs perfect graph theorem 

Copyright information

© Akadémiai Kiadó 1986

Authors and Affiliations

  • K. Cameron
    • 1
  • J. Edmonds
    • 1
  • L. Lovász
    • 2
  1. 1.Department of Combinatorics and OptimizationUniversity of WaterlooWaterlooCanada
  2. 2.Eötvös Loránd TudományegyetemMatematikai IntézetBudapestHungary