Delay colourings of cubic graphs
The electronic journal of combinatorics, Tome 20 (2013) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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

Agelos Georgakopoulos  1

1 University of Warwick
@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/}
}
TY  - JOUR
AU  - Agelos Georgakopoulos
TI  - Delay colourings of cubic graphs
JO  - The electronic journal of combinatorics
PY  - 2013
VL  - 20
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2920/
DO  - 10.37236/2920
ID  - 10_37236_2920
ER  - 
%0 Journal Article
%A Agelos Georgakopoulos
%T Delay colourings of cubic graphs
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/2920/
%R 10.37236/2920
%F 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 :