1. H.L. Bodlaender, ACHROMATIC NUMBER is NP-complete for cographs and interval graphs, Info. Proc. Letters 31 (1989), 135–138
2. D.G. Corneil, H. Lerchs, L. Stuart Burlingham, Complement reducible graphs, Discr. Appl. Math. 3 (1981), 163–174
3. P.Damaschke, Induced subgraphs and well-quasi ordering, to appear in J. of Graph Theory
4. M.R. Garey, D.S. Johnson, Computers and intractability, a guide to the theory of NP-completeness, Freeman, San Francisco 1979
5. M.C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York 1980