1. Least fixed point of a functor;ADAMEK;J. Comput. System Sci.,1979
2. Complexity of finding an embedding in a k-tree;ARNBORG;SIAM J. of Algebraic Discrete Methods,1987
3. ARNBORG, S., J. LAGERGREN and D. SEESE, Problems easy for tree decomposable graphs, in: T. Lepistö and A. Salomaa, eds., Proc. 15th Internat. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 317 (Springer, Berlin, 1988) 38–51.
4. ARNBORG, S. and A. PROSKUROWSKI, Linear time algorithms for NP-hard problems on graphs embedded in k-trees, Tech. Report TRITA-NA 8404, Stockholm, 1984.
5. Forbidden minors characterization of partial 3-trees;ARNBORG,1986