Complexity of clique coloring and related problems (Q551168)

From MaRDI portal
Revision as of 07:30, 4 July 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
Complexity of clique coloring and related problems
scientific article

    Statements

    title
    Complexity of clique coloring and related problems (English)
    0 references
    author
    Dániel Marx
    0 references
    publication date
    14 July 2011
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    05C69
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5920426
    0 references
    zbMATH Keywords
    clique coloring
    0 references
    choosability
    0 references
    complexity
    0 references
    polynomial hierarchy
    0 references
    OpenAlex ID
    W2026705714
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q551168&oldid=35237499"
    Powered by MediaWiki