1. Alon, N., Seymour, P., Thomas, R.: A separator theorem for graphs with an excluded minor and its applications. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 13–17 May 1990, Baltimore, Maryland, USA, pp. 293–299 (1990)
2. Arnborg, S.: Efficient algorithms for combinatorial problems with bounded decomposability - a survey. BIT 25(1), 1–23 (1985)
3. Arnborg, S., Corneil, D., Proskuroswk, A.: Complexity of finding embeddings in a k-tree. SIAM J. Discret. Math. 8(2), 277–284 (1987)
4. Hans, L.: Bodlaender: a linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 12–75 (1996)
5. Courceller, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graph. Inf. Comput. 85(1), 1305–1317 (1990)