The complexity of changing colourings with bounded maximum degree (Q407523)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of changing colourings with bounded maximum degree
scientific article

    Statements

    The complexity of changing colourings with bounded maximum degree (English)
    0 references
    0 references
    27 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial problems
    0 references
    computational complexity
    0 references
    graph algorithms
    0 references
    \(k\)-colouring
    0 references
    0 references