Playing Sudoku on random 3-regular graphs

Jack Dippel, Austin Eide, Pawel Pralat +1

The Sudoku number $s(G)$ of graph $G$ with chromatic number $\chi (G)$ is the smallest partial $\chi (G)$-colouring of $G$ that determines a unique $\chi (G)$-colouring of the entire graph. We…