Reference 49

(back to home) (about this survey)

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