Author:
Arnborg Stefan,Proskurowski Andrzej
Publisher
Springer International Publishing
Reference17 articles.
1. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in k-trees. SIAM J. Algebraic Discrete Methods 8(2), 277–284 (1987)
2. Arnborg, S., Hedetniemi, S.T., Proskurowski, A.: Algorithms on graphs with bounded treewidth. Discrete Appl. Math. 54(2–3) (1994)
3. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308–340 (1991)
4. Arnborg, S., Proskurowski, A.: Problems on graphs with bounded decomposability. In: Proceedings of the 17th South-Eastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, Congressus Numerantium, vol. 53, pp. 167–170 (1986)
5. Arnborg, S., Proskurowski, A.: Characterization and recognition of partial 3-trees. SIAM J. Algebraic. Discrete Methods 7(2), 305–314 (1986)