Delay colourings of cubic graphs
Abstract
In this note we prove the conjecture of 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.