1. A. Brandstädt, F.F. Dragan, H.-O. Le, R. Mosca, New graph classes of bounded clique width, in: Proc. of Graph-Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 2573, Springer, Berlin, 2002, pp. 57–67.
2. Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications;Brandstädt,1999
3. D.G. Corneil, M. Habib, J.M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition of clique-width at most three graphs, in: Proc. of Latin American Symposium on Theoretical Informatics, Lecture Notes in Computer Science, Vol. 1776, Springer, Berlin, 2000, pp. 126–134.
4. Complement reducible graphs;Corneil;Discrete Appl. Math.,1981
5. A linear recognition algorithm for cographs;Corneil;SIAM J. Comput.,1985