|
|||||
|
|
A note on perfect graphs |
|
| Authors: | K. Cameron J. Edmonds L. Lovász |
| Affiliation: | (1) Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1 Waterloo, Ontario, Canada;(2) Eötvös Loránd Tudományegyetem, Matematikai Intézet, Múzeum Krt. 6-8, H-1088 Budapest, Hungary |
| Abstract: | 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. |
| Keywords: | Primary 05C75 Secondary 05C15 |
| 本文献已被 SpringerLink 等数据库收录！ | |