Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

Arnborg, 1985, Efficient algorithms for combinatorial problems on graphs with bounded decomposability—A survey, BIT, 25, 2, 10.1007/BF01934985 Arnborg, 1987, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, 8, 277, 10.1137/0608024 Arnborg, 1988, Problems easy for tree-decomposable graphs (extended abstract), Vol. 317, 38 Arnborg, 1986, Characterization and recognition of partial 3-trees, SIAM J. Algebraic Discrete Methods, 7, 305, 10.1137/0607033 Arnborg, 1989, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Appl. Math., 23, 11, 10.1016/0166-218X(89)90031-0 Bodlaender, 1986, Classes of graphs with Bounded Treewidth Bodlaender, 1987, Dynamic Programming Algorithms on Graphs with Bounded Treewidth Bodlaender, 1988, Improved Self-reduction Algorithms for Graphs with Bounded Treewidth Bodlaender, 1988, NC-algorithms for graphs with small treewidth, Vol. 344, 1 Borie, 1988 Chanrasekharan, 1988, Fast parallel algorithms for tree decomposition and parsing partial k-trees Courcelle, 1990, The monadic second order logic of graphs. I. Recognizable sets of finite graphs, Inform. and Comput., 85, 12, 10.1016/0890-5401(90)90043-H Holyer, 1981, The NP-completeness of edge-coloring, SIAM J. Comput., 10, 718, 10.1137/0210055 Hopcroft, 1973, An n52 algorithm for maximum matching in bipartite graphs, SIAM J. Comput., 2, 225, 10.1137/0202019 Johnson, 1985, The NP-completeness column: An ongoing guide, J. Algorithms, 6, 434, 10.1016/0196-6774(85)90012-4 Matousěk, 1988 Robertson, 1984, Graph minors. III. Planar tree-width, J. Combin. Theory Ser. B, 36, 49, 10.1016/0095-8956(84)90013-3 Robertson, 1986 Scheffler, 1987, Linear-Time Algorithms for NP-Complete Problems Restricted to Partial k-Trees Scheffler, 1989, Die Baumweite von Graphen als ein Maß für die Kompliziertheit algorithmischer Probleme Sysło, 1983, NP-complete problems on some tree-structured graphs: A review, 342 van Leeuwen, 1990, Graph algorithms Wimer, 1987, Linear Algorithms on k-Terminal Graphs