Complexity of unique list colorability (Q935144)

From MaRDI portal
Revision as of 15:27, 7 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of unique list colorability
scientific article

    Statements

    title
    Complexity of unique list colorability (English)
    0 references
    author
    Dániel Marx
    0 references
    publication date
    31 July 2008
    0 references
    zbMATH Keywords
    graph coloring
    0 references
    list coloring
    0 references
    unique coloring
    0 references
    complexity
    0 references
    polynomial hierarchy
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C15
    0 references
    68Q15
    0 references
    68R10
    0 references
    zbMATH DE Number
    5306530
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q935144&oldid=1208580"
      Powered by MediaWiki