Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: all
Choose Problem

Authors: Viresh Patel
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)

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