1 paper · 1 filter
Gaétan Berthe, Caroline Brosse, Brian Hearn +3
Given a graph G and a natural number k, the k-recolouring graph Ck(G) is the graph whose vertices are the k-colourings of G and whose edges link pairs of col…