NP-completeness of local colorings of graphs (Q1679905)

From MaRDI portal
scientific article
Language Label Description Also known as
English
NP-completeness of local colorings of graphs
scientific article

    Statements

    NP-completeness of local colorings of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 November 2017
    0 references
    0 references
    local \(k\)-coloring
    0 references
    local chromatic number
    0 references
    planar graph
    0 references
    NP-complete
    0 references
    computational complexity
    0 references
    0 references