Delay colourings of cubic graphs

Agelos Georgakopoulos

Delay colourings of cubic graphs

Combinatorics 2013-08-29 v2

Authors: Agelos Georgakopoulos

Abstract

In this note we prove the conjecture of \cite{HaWiWi} that every bipartite multigraph with integer edge delays admits an edge colouring with $d+1$ colours in the special case where $d=3$ . A connection to the Brualdi-Ryser-Stein conjecture is discussed.

Keywords

rainbow coloring graph coloring ramsey theory and colorings

Cite

@article{arxiv.1211.1306,
  title  = {Delay colourings of cubic graphs},
  author = {Agelos Georgakopoulos},
  journal= {arXiv preprint arXiv:1211.1306},
  year   = {2013}
}

Comments

Published by the Electronic Journal of Combinatorics

Related papers

View all related →