Delay colourings of cubic graphs

作者：Georgakopoulos Agelos^*

来源：Electronic Journal of Combinatorics, 2013, 20(3): P45.

In this note we prove the conjecture of Wilfong, Haxell and Winkler (2001) 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.

• 出版日期2013-9-20