A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Delay Colouring in Quartic Graphs
2020
Electronic Journal of Combinatorics
Preserved Fulltext
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