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

From MaRDI portal
Revision as of 10:52, 13 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    title
    Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete (English)
    0 references
    author
    David P. Dailey
    0 references
    publication date
    1980
    0 references
    zbMATH DE Number
    3700870
    0 references
    zbMATH Keywords
    unique colorability
    0 references
    NP-complete
    0 references
    4-regular graph
    0 references
    Wikidata QID
    Q55899212
    0 references
    cites work
    Q4138187
    0 references
    Q4142699
    0 references
    Q4773298
    0 references
    Q4198056
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1146685&oldid=34645589"
    Powered by MediaWiki