ArticlesOn Perfect Cayley Graphs
References (21)
On the perfect graph theorem
Normal hypergraphs and the perfect graph conjecture
Discrete Math
(1972)- et al.
The strong perfect graph conjecture is ture for K1,3-free graphs
J. Combin. Theory ser
(1976) - et al.
The validity of the strong perfect graph conjecture for (K4 − e)-free graphs
J. Comb. Theory ser
(1979) Cn-factors of group graphs
On a property of a class of n-colorable graphs
J. Comb. Theory ser
(1974)Critical Graphs and perfect 3-chromatic graphs
J. Comb. Theory ser
(1977)Coloring perfect (K4 − e)-free graphs
J. Comb. Theory ser
(1987)Les problemes de coloration en theorie des graphes
Publ. Inst. Stat. Univ. Paris
(1960)- et al.
Topics on Perfect Graphs
Ann. Discrete Math
(1984)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2002 Published by Elsevier B.V.