1. Counting edge-kempe-equivalence classes for 3-edge-colored cubic graphs;Belcastro;Discrete Math.,2014
2. Perfectly contractile graphs;Bertschi;J. Combin. Theory Ser. B,1990
3. Recoloring bounded treewidth graphs;Bonamy,2013
4. M. Bonamy, N. Bousquet, C. Feghali, M. Johnson, On a conjecture of Mohar concerning Kempe equivalence of regular graphs, 2015. arXiv:1510.06964.
5. Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs;Bonamy;J. Comb. Optim.,2014