An Efficient Algorithm for Colouring the Edges of a Graph With Δ + 1 Colours (Q3671194)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An Efficient Algorithm for Colouring the Edges of a Graph With Δ + 1 Colours
scientific article

    Statements

    An Efficient Algorithm for Colouring the Edges of a Graph With Δ + 1 Colours (English)
    0 references
    0 references
    1982
    0 references
    0 references
    maximum degree
    0 references
    edge colourability
    0 references
    0 references