Delay colourings of cubic graphs (Q396884)

From MaRDI portal
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

    Identifiers