1. S. Arnborg, J. Lagergren, D. Seese. Easy problems for tree-decomposable graphs. J. of Algorithms, 12:308–340, 1991.
2. S. Arnborg, A. Proskurowski. Linear time algorithms on graphs with bounded tree-width. LNCS, 317:105–119, 1989.
3. F.J. Brandenburg. On partially ordered graph grammars. LNCS, 291: 99–111, 1987.
4. F.J. Brandenburg. The equivalence of boundary and confluent graph grammars on graph languages of bounded degree. LNCS, 488:312–322, 1991.
5. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In SIAM J. Computing, 25:1305–1317, 1996.