1 paper
Lucas De Meyer, Clément Legrand-Duchesne, Jared León +2
Reed conjectured that the chromatic number of any graph is closer to its clique number than to its maximum degree plus one. We consider a recolouring version of this conjecture, wi…