Finding Paths between Colourings. - Luis Cereceda (ACiD, 2006)

Finding Paths between Graph Colourings: Computational Complexity and Possible Distances. - Paul S. Bonsma; Luis Cereceda; Jan van den Heuvel; Matthew Johnson 002 (Electron. Notes Discret. Math., 2007)

Finding Paths Between 3-Colourings. - Matthew Johnson 002; Luis Cereceda; Jan van den Heuvel (IWOCA, 2008)

Connectedness of the graph of vertex-colourings. - Luis Cereceda; Jan van den Heuvel; Matthew Johnson 002 (Discret. Math., 2008)

Mixing 3-colourings in bipartite graphs. - Luis Cereceda; Jan van den Heuvel; Matthew Johnson 002 (Eur. J. Comb., 2009)

Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances. - Paul S. Bonsma; Luis Cereceda (Theor. Comput. Sci., 2009)

Finding paths between 3-colorings. - Luis Cereceda; Jan van den Heuvel; Matthew Johnson 002 (J. Graph Theory, 2011)