1. S. Alstrup, C. Gavoille, H. Kaplan, T. Rauhe, Nearest common ancestors: A survey and a new distributed algorithm. in: Proc. Annu. ACM Symp. Parallel Algorithms and Architectures, ACM, 2002, pp. 258–264.
2. Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees;Bodlaender;J. Algorithms,1990
3. A. Brandstädt, F.F. Dragan, H.-O. Le, R. Mosca, New graph classes of bounded clique width, in: Proc. Graph-Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 2573, Springer, Berlin, 2002, pp. 57–67.
4. D.G. Corneil, M. Habib, J.M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition of clique-width at most three graphs, in: Proc. Latin American Symp. on Theoretical Informatics, Lecture Notes in Computer Science, Vol. 1776, Springer, Berlin, 2000, pp. 126–134.
5. A linear recognition algorithm for cographs;Corneil;SIAM J. Comput.,1985