Delay colourings of cubic graphs

Agelos Georgakopoulos

Published 2012-11-06, updated 2013-08-28Version 2

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.