Delay colourings of cubic graphs

preprint2013arXivOpen access

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+1d+1 colours in the special case where d=3d=3. A connection to the Brualdi-Ryser-Stein conjecture is discussed.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.