Delay Colouring in Quartic Graphs
Abstract
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$.
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$.