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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T. Gallai, Transitiv orientierbare Graphen,Acta Math. Acad. Sci. Hungar. 18 (1967), 25–66.MR 36: 5026
L. Lovász, Normal hypergraphs and the perfect graph conjecture,Discrete Math. 2 (1972), 253–267.MR 46: 1624
E. Olaru, Über kritisch imperfekte Graphen und die starke Vermutung der perfekten Graphen,XVIII. Internationales Wissenschaftliches Kolloquium, Technische Hochschule Ilmenau, 1973; Heft 2, 19–22.Zbl 282: 05111
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cameron, K., Edmonds, J. & Lovász, L. A note on perfect graphs. Period Math Hung 17, 173–175 (1986). https://doi.org/10.1007/BF01848646
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01848646