1 problem

Recolouring conjecture for odd-hole-free graphs
Odd-hole-free recolouring conjecture. All odd-hole-free graphs of maximum degree $\Delta$ and clique number $\omega$ are $k$ -recolourable for
opengraph-colouring odd-hole-free-graphs reconfiguration
0 responses
04

Recolouring conjecture for odd-hole-free graphs