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$.
@article{10_37236_8215,
author = {Katherine Edwards and W. Sean Kennedy},
title = {Delay colouring in quartic graphs},
journal = {The electronic journal of combinatorics},
year = {2020},
volume = {27},
number = {3},
doi = {10.37236/8215},
zbl = {1445.05039},
url = {http://geodesic.mathdoc.fr/articles/10.37236/8215/}
}
TY - JOUR
AU - Katherine Edwards
AU - W. Sean Kennedy
TI - Delay colouring in quartic graphs
JO - The electronic journal of combinatorics
PY - 2020
VL - 27
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/8215/
DO - 10.37236/8215
ID - 10_37236_8215
ER -
%0 Journal Article
%A Katherine Edwards
%A W. Sean Kennedy
%T Delay colouring in quartic graphs
%J The electronic journal of combinatorics
%D 2020
%V 27
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/8215/
%R 10.37236/8215
%F 10_37236_8215
Katherine Edwards; W. Sean Kennedy. Delay colouring in quartic graphs. The electronic journal of combinatorics, Tome 27 (2020) no. 3. doi: 10.37236/8215
