Abstract: In this note we prove the conjecture of cite{HaWiWi} that every bipartite multigraph with integer edge delays admits an edge colouring with colours in the special case where . A connection to the Brualdi-Ryser-Stein conjecture is discussed.
Summary: In this note we prove the conjecture of \textit{G. T. Wilfong} et al. [``Delay coloring and optical networks, Preprint (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\).
Recommendations
- Edge Colouring with Delays
- Delay colouring in quartic graphs
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
- Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\)
Cites work
Cited in
(3)
This page was built for publication: Delay colourings of cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396884)