Type: Article
Publication Date: 2013-09-20
Citations: 2
DOI: https://doi.org/10.37236/2920
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$.
Action | Title | Year | Authors |
---|---|---|---|
+ PDF Chat | Transversals in Latin Squares | 2024 |
Richard Montgomery |