Polynomial time complexity of edge colouring graphs with bounded colour classes (Q2249736)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Polynomial time complexity of edge colouring graphs with bounded colour classes
scientific article

    Statements

    Polynomial time complexity of edge colouring graphs with bounded colour classes (English)
    0 references
    0 references
    0 references
    0 references
    3 July 2014
    0 references
    edge-colouring
    0 references
    chromatic index
    0 references
    equalized edge-colouring
    0 references

    Identifiers