1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
2. H. Bodlaender, Classes of graphs with bounded tree-width, in: Bulletin of the European Association for Theoretical Computer Science, EATCS, vol. 36, 1988, pp. 116–125.
3. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theoret. Comput. Sci.,1998
4. Approximating treewidth, pathwidth, frontsize, and shortest elimination tree;Bodlaender;J. Algorithms,1995
5. The pathwidth and treewidth of cographs;Bodlaender;SIAM J. Discrete Math.,1993