
arXiv: 1211.1306
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$.
edge colouring, Coloring of graphs and hypergraphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), cubic graph, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 05C15, 05C70
edge colouring, Coloring of graphs and hypergraphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), cubic graph, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 05C15, 05C70
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
