Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: all
Choose Problem

Authors: Daniël Paulusma
Choose Author


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

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

[46]
Paul S. Bonsma and Daniël Paulusma,
Using contracted solution graphs for solving reconfiguration problems,
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Leibniz International Proceedings in Informatics 58, pp. 20:01-20:15, 2016. (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)