Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances.

Paul S. Bonsma, Luis Cereceda

Browse the full MFCS paper archive.