1. A. Arnborg and A. Proskurowski. Linear time algorithms for np-hard problems on graphs embedded in k-trees. Technical Report TRITA-NA-8404, Department of Numerical Analysis and Computer Science, Royal Institute of Technology, Stockholm, Sweden, 1984.
2. A. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. and Discr. Methods, 8:277–284, 1987.
3. U. Bertele and F. Brioschi. Nonserial Dynamic Programming. Academic, New York, 1972.
4. H. L. Bodlaender. A linear-time algorithm for finding tree-compositions of small treewidth. SIAM Journal on Computing, 25:1305–1317, 1996.
5. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.