Delay colouring in quartic graphs
type: Item
instance of: scholarly article
title: Delay colouring in quartic graphs
zbMATH Open document ID: 1445.05039
DOI: 10.37236/8215
author: Katherine Edwards
author: W. Sean Kennedy
published in: The Electronic Journal of Combinatorics
publication date: 2020-08-07T00:00:00Z
review text: Summary: \textit{P. Haxell}, \textit{G. Wilfong} and \textit{P. Winkler} [``Delay coloring and optical networks'', Preprint] conjectured that every bipartite graph with maximum degree \(\Delta\) is \((\Delta + 1)\)-delay-colourable. We prove this conjecture in the special case \(\Delta = 4\).
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7229460
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.37236/8215
OpenAlex ID: W3082046428
cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
cites work: Colorings and orientations of graphs
cites work: Delay colourings of cubic graphs
cites work: New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
cites work: A Combinatorial Problem on Abelian Groups
description: scientific article; zbMATH DE number 7229460