1. M.R. Fellows and K. Abrahamson 1989, Cutset-Regularity Beats Well-Quasi-Ordering for Bounded Tree-width (Extended Abstract), preprint Nov. 1989.
2. S. Arnborg, A. Proskurowski and D.G. Corneil 1986, Forbidden minor characterization of partial 3-trees, Discrete Math., to appear.
3. S.Arnborg, B.Courcelle, A. Proskurowski and D. Seese 1990, An algebraic theory of graph reduction, preprint January 17, 1990.
4. S. Arnborg and J. Lagergren 1990, Finding minimal forbidden minors using a finite congruence, preprint November 13, 1990.
5. S. Arnborg, J. Lagergren and D. Seese 1988, Problems Easy for Tree-descomosable graphs (extended abstract). Proc. 15th ICALP, Springer Verlag, Lect. Notes in Comp. Sc. 317 38–51.