Finding Shortest Paths Between Graph Colourings

Kernelization Lower Bounds by Cross-Composition

(2014) Hans L. Bodlaender et al.   SIAM JOURNAL ON DISCRETE MATHEMATICS

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs

(2012) Marthe Bonamy et al.   JOURNAL OF COMBINATORIAL OPTIMIZATION

Complexity of independent set reconfigurability problems

(2012) Marcin Kamiński et al.   THEORETICAL COMPUTER SCIENCE

Shortest paths between shortest paths

(2011) Marcin Kamiński et al.   THEORETICAL COMPUTER SCIENCE

Finding paths between 3-colorings

(2010) Luis Cereceda et al.   JOURNAL OF GRAPH THEORY

On the complexity of reconfiguration problems

(2010) Takehiro Ito et al.   THEORETICAL COMPUTER SCIENCE

Mixing 3-colourings in bipartite graphs

(2009) Luis Cereceda et al.   EUROPEAN JOURNAL OF COMBINATORICS

The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies

(2009) Parikshit Gopalan et al.   SIAM JOURNAL ON COMPUTING

Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances

(2009) Paul Bonsma et al.   THEORETICAL COMPUTER SCIENCE

Connectedness of the graph of vertex-colourings

(2007) Luis Cereceda et al.   DISCRETE MATHEMATICS