1. Paul S. Bonsma, Shortest path reconfiguration is PSPACE-hard, CoRR, abs/1009.3217, 2010.
2. Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances;Bonsma;Theoret. Comput. Sci.,2009
3. Finding paths between graph colourings: computational complexity and possible distances;Bonsma;Electron. Notes Discrete Math.,2007
4. Connectedness of the graph of vertex-colourings;Cereceda;Discrete Math.,2008
5. Luis Cereceda, Jan van den Heuvel, Matthew Johnson, Finding paths between 3-colourings, in: Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, 2008, pp. 182–196.