Delay colourings of cubic graphs
The electronic journal of combinatorics, Tome 20 (2013) no. 3
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$.
DOI :
10.37236/2920
Classification :
05C15, 05C70
Mots-clés : cubic graph, edge colouring
Mots-clés : cubic graph, edge colouring
Affiliations des auteurs :
Agelos Georgakopoulos  1
@article{10_37236_2920,
author = {Agelos Georgakopoulos},
title = {Delay colourings of cubic graphs},
journal = {The electronic journal of combinatorics},
year = {2013},
volume = {20},
number = {3},
doi = {10.37236/2920},
zbl = {1298.05116},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2920/}
}
Agelos Georgakopoulos. Delay colourings of cubic graphs. The electronic journal of combinatorics, Tome 20 (2013) no. 3. doi: 10.37236/2920
Cité par Sources :