1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebr. Discrete Methods,1987
2. T. Beyer, S.M. Hedetniemi, S.T. Hedetniemi, A linear algorithm for the grundy number of a tree, in: Proceedings of the Thirteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, 1982.
3. A linear-time algorithm for finding tree-decompositions of small treewidth;Bodlaender;SIAM J. Comput.,1996
4. Recoloring bounded treewidth graphs;Bonamy,2013
5. Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs;Bonamy;J. Comb. Optim.,2012