Delay Colouring in Quartic Graphs

Katherine Edwards, W. Sean Kennedy
2020 Electronic Journal of Combinatorics  
Haxell, Wilfong, and Winkler conjectured that every bipartite graph with maximum degree $\Delta$ is $(\Delta + 1)$-delay-colourable. We prove this conjecture in the special case $\Delta = 4$.
doi:10.37236/8215 fatcat:yj57u4pwcjfojcp44sy7cxarfe