Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: all
Choose Problem

Authors: Luis Cereceda
Choose Author


[3]
Luis Cereceda, Jan van den Heuvel and Matthew Johnson,
Connectedness of the graph of vertex-colourings,
Discrete Mathematics 308(5-6), pp. 913-919, 2008. (LINK)

[4]
Paul S. Bonsma and Luis Cereceda,
Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances,
Theoretical Computer Science 410(50), pp. 5215-5226, 2009. (LINK)

[5]
Luis Cereceda, Jan van den Heuvel and Matthew Johnson,
Mixing 3-colourings in bipartite graphs,
European Journal of Combinatorics 30(7), pp. 1593-1606, 2009. (LINK)

[10]
Luis Cereceda, Jan van den Heuvel and Matthew Johnson,
Finding paths between 3-colorings,
Journal of Graph Theory 67(1), pp. 69-82, 2011. (LINK)