Delay Colourings of Cubic Graphs

Electronic Journal Of Combinatorics

Agelos Georgakopoulos¹ 

关键词: cubic graph;    edge colouring;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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$.

【 授权许可】

Others