1. Recoloring bounded treewidth graphs;Bonamy;Electron. Notes Discrete Math.,2013
2. Recoloring graphs via tree decompositions;Bonamy;CoRR,2014
3. Reconfiguring independent sets in cographs;Bonamy;CoRR,2014
4. Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs;Bonamy;J. Comb. Optim.,2012
5. Finding paths between graph colourings: Pspace-completeness and superpolynomial distances;Bonsma;Theoret. Comput. Sci.,2009