Delay colourings of cubic graphs (Q396884): Difference between revisions

Summary: In this note we prove the conjecture of \textit{G. T. Wilfong} et al. [``Delay coloring and optical networks'', Preprint (2001)] that every bipartite multi-graph with integer edge delays admits an edge colouring with \(d+1\) colours in the special case when \(d = 3\).