Delay colourings of cubic graphs
classification
🧮 math.CO
keywords
conjectureedgeadmitsbipartitebrualdi-ryser-steincasecitecolouring
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.