  In this note we prove the conjecture of \cite{HaWiWi} that every bipartite
multigraph with integer edge delays admits an edge colouring with $d+1$ colours
in the special case where $d=3$. A connection to the Brualdi-Ryser-Stein
conjecture is discussed.
