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 $\ddot{I}‡(G)$ is the smallest partial $\ddot{I}‡(G)$-colouring of $G$ that determines a unique $\ddot{I}‡(G)$-colouring of the entire graph.…