Delay Colourings of Cubic Graphs

[摘要] In this note we prove the conjecture of  Wilfong, Haxell and Winkler (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$.

[学科分类] 离散数学和组合数学

[关键词] cubic graph;edge colouring