Delay Colourings of Cubic Graphs

  • Agelos Georgakopoulos
DOI: https://doi.org/10.37236/2920
Keywords: cubic graph, edge colouring

Abstract

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

Published
2013-09-20
How to Cite
Georgakopoulos, A. (2013). Delay Colourings of Cubic Graphs. The Electronic Journal of Combinatorics, 20(3), P45. https://doi.org/10.37236/2920
Issue
Volume 20, Issue 3 (2013)
Article Number
P45