Théo Pierron

Determining a graph from its reconfiguration graph

Given a graph G and a natural number k , the k -recolouring graph C k ( G ) is the graph whose vertices are the k -colourings of G and whose edges link pairs of colourings which differ at exactly one vertex of G . Recently, Hogan et al. proved that G can be determined from C k (...