1. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability,BIT,25 (1985), 2–23.
2. S. Arnborg, D. G. Corneil, and A. Proskurowski, Complexity of finding embeddings in ak-tree,SIAM Journal of Algebraic and Discrete Methods,8 (1987), 277–284.
3. A. Arnborg, J. Lagergren, and D. Seese, Problems easy for tree-decomposable graphs, (extended abstract)Proceedings of the 15th ICALP, Lecture Notes in Computer Science, Vol. 317. Springer-Verlag, Berlin (1988), pp. 38–51; to appear inJournal of Algorithms.
4. A. Arnborg and A. Proskurowski, Linear time algorithms forNP-hard problems on graphs embedded ink-trees, TRITA-NA-8404, Royal Institute of Technology, Sweden (1984).
5. M. Bauderon and B. Courcelle, Graph expressions and graph rewritings,Mathematical Systems Theory,20 (1987), 83–127.