Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:


[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)

[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)

[9]
Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel and Daniël Paulusma,
On the diameter of reconfiguration graphs for vertex colourings,
Proceedings of the 6th European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2011), Electronic Notes in Discrete Mathematics 38, pp. 161-166, 2011. (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)

[23]
Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel and Daniël Paulusma,
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs,
Journal of Combinatorial Optimization 27(1), pp. 132-143, 2014. (LINK)

[32]
Marthe Bonamy, Nicolas Bousquet, Carl Feghali and Matthew Johnson,
On a conjecture of Mohar concerning Kempe equivalence of regular graphs,
arXiv 1510.06964, 2015. (LINK)

[49]
Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel and Daniël Paulusma,
Finding shortest paths between graph colourings,
Algorithmica 75(2), pp. 295-321, 2016. (LINK)

[59]
Carl Feghali, Matthew Johnson and Daniël Paulusma,
Kempe equivalence of colourings of cubic graphs,
European Journal of Combinatorics 59, pp. 1-10, 2017. (LINK)