Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete (Q1146685)

From MaRDI portal
Revision as of 04:14, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
scientific article

    Statements

    Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete (English)
    0 references
    0 references
    1980
    0 references
    unique colorability
    0 references
    NP-complete
    0 references
    4-regular graph
    0 references

    Identifiers