Shortest path reconfiguration is PSPACE-hard, manuscript, 2010. ,
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
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
Finding paths between 3-colorings, Journal of Graph Theory, vol.7, issue.1, pp.69-82, 2011. ,
DOI : 10.1002/jgt.20514
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
A characterization of chordal bipartite graphs, tech. rep. (Rutgers University, 1989. ,
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
Shortest Paths between Shortest Paths and Independent Sets, Proceedings IWOCA 2010, pp.56-67, 2011. ,
DOI : 10.1007/978-3-642-03367-4_33