P. Bonsma, Shortest path reconfiguration is PSPACE-hard, manuscript, 2010.

P. Bonsma and L. Cereceda, Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances, Theoretical Computer Science, vol.410, issue.50, pp.5215-5226, 2009.
DOI : 10.1016/j.tcs.2009.08.023

URL : http://dx.doi.org/10.1016/j.tcs.2009.08.023

L. Cereceda, J. Van-den-heuvel, and M. Johnson, Mixing 3-colourings in bipartite graphs, European Journal of Combinatorics, vol.30, issue.7, pp.1593-1606, 2009.
DOI : 10.1016/j.ejc.2009.03.011

L. Cereceda, J. Van-den-heuvel, and M. Johnson, Finding paths between 3-colorings, Journal of Graph Theory, vol.7, issue.1, pp.69-82, 2011.
DOI : 10.1002/jgt.20514

P. Gopalan, P. G. Kolaitis, E. N. Maneva, and C. H. Papadimitriou, The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies, SIAM Journal on Computing, vol.38, issue.6, pp.2330-2355, 2009.
DOI : 10.1137/07070440X

P. L. Hammer, F. Maffray, and M. Preismann, A characterization of chordal bipartite graphs, tech. rep. (Rutgers University, 1989.

F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, Journal of Combinatorial Theory, Series B, vol.16, issue.1, pp.47-56, 1974.
DOI : 10.1016/0095-8956(74)90094-X

M. Kaminski, P. Medvedev, and M. Milanic, Shortest Paths between Shortest Paths and Independent Sets, Proceedings IWOCA 2010, pp.56-67, 2011.
DOI : 10.1007/978-3-642-03367-4_33