1. Blidia, M., Ikhlef-Eschouf, N., Maffray, F.: Caractérisation des graphes bγ-parfaits. In: Actes du 4eme Colloque sur l’Optimisation et les Systèmes d’Information (COSI’2007), pp. 179–190, Oran, Algeria, 2007. An English version is given in [2] below
2. Blidia, M., Ikhlef-Eschouf, N., Maffray, F.: Characterization of bγ-perfect graphs. Cahiers Leibniz 171, July 2008, http://www.g-scop.inpg.fr/CahiersLeibniz/2008/171/171.html
3. Bodlaender, H.L.: Achromatic number is NP-complete for cographs and interval graphs. Inf. Proc. Lett., 31, 135–138 (1989)
4. Corneil, D., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Disc. Appl. Math., 3(3), 163–174 (1981)
5. Corneil, D., Perl, Y., Stewart, L.: Cographs: recognition, applications and algorithms. Cong. Numer., 43, 249–258 (1984)