1. A characterization of perfect graphs;Lovász;J. Combinatorial Theory Ser. B,1972
2. K.R. Parthasarathy and G. Ravindra, The strong perfect-graph conjecture is true for K -free graphs, J. Combinatorial Theory (to appear).
3. K.R. Parthasarathy and G. Ravindra, The validity of the strong perfect-graph conjective for (K4 − x)-free graphs (submitted to J. Combinatorial Theory).
4. G. Ravindra, Perfectness of normal products of graphs (submitted for publication).
5. On the Berge conjecture concerning perfect graphs;Sachs,1970