Delay colourings of cubic graphs (Q396884): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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\). | |||
| Property / review text: 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\). / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6330317 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cubic graph | |||
| Property / zbMATH Keywords: cubic graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
edge colouring | |||
| Property / zbMATH Keywords: edge colouring / rank | |||
Normal rank | |||
Revision as of 15:29, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Delay colourings of cubic graphs |
scientific article |
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
