Delay colouring in quartic graphs
Summary: \textit{P. Haxell}, \textit{G. Wilfong} and \textit{P. Winkler} [``Delay coloring and optical networks'', Preprint] conjectured that every bipartite graph with maximum degree \(\Delta\) is \((\Delta + 1)\)-delay-colourable. We prove this conjecture in the special case \(\Delta = 4\).
scientific article; zbMATH DE number 7229460