The complexity of the empire colouring problem (Q476435)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of the empire colouring problem
scientific article

    Statements

    The complexity of the empire colouring problem (English)
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    colouring
    0 references
    planar graphs
    0 references
    NP-hardness
    0 references
    graph algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references