Delay colouring in quartic graphs (Q785576)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7229460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Delay colouring in quartic graphs |
scientific article; zbMATH DE number 7229460 |
Statements
Delay colouring in quartic graphs (English)
0 references
7 August 2020
0 references
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\).
0 references
0 references
0.8542158007621765
0 references
0.7990164756774902
0 references
0.7888789772987366
0 references
0.7503048181533813
0 references
