1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
2. S. Arnborg, J. Lagergren, D. Seese, Problems easy for tree-decomposable graphs (extended abstract), Proc. 15th ICALP, Lecture Notes in Computer Science, Vol. 317, Springer, Berlin, 1988, pp. 38–51.
3. Easy problems for tree-decomposable graphs;Arnborg;J. Algorithms,1991
4. K. Barthelmann, On equational graphs, Technical Report 9, Universität Mainz, Institut für Informatik, 1997.
5. A. Baudisch, Zur Methatheorie abelscher Gruppen, Dissertation, Humboldt-Universitaet zu Berlin, 1974 (translation: To the meta-theory of abelian groups).