1. NP-completeness of edge colouring some restricted graphs;Cai;Discrete Appl. Math.,1991
2. D.G. Corneil, M. Habib, J.M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition of clique-width ⩽ 3 graphs (Extended Abstract), in: Proceedings of the Latin American Theoretical INformatic, LATIN’2000, Lecture Notes in Computer Science, Vol. 1776, Springer, New York, 2000, pp. 126–134.
3. B. Courcelle, private communication.
4. Handle-rewriting hypergraphs grammars;Courcelle;J. Comput. System Sci.,1993
5. Linear time solvable optimization problems on graphs of bounded clique-width;Courcelle;Theory Comput. Systems,2000