Delay colourings of cubic graphs (Q396884)
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 6330317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Delay colourings of cubic graphs |
scientific article; zbMATH DE number 6330317 |
Statements
Delay colourings of cubic graphs (English)
0 references
14 August 2014
0 references
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\).
0 references
cubic graph
0 references
edge colouring
0 references
0.8551807403564453
0 references
0.8542158007621765
0 references
0.8433938026428223
0 references
0.7680326104164124
0 references
0.7641927599906921
0 references
