Electronic Resource
Springer
Periodica mathematica Hungarica
17 (1986), S. 173-175
ISSN:
1588-2829
Keywords:
Primary 05C75
;
Secondary 05C15
;
Perfect graphs
;
complementary graphs
;
perfect graph theorem
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01848646
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |