Exploring the complexity boundary between coloring and list-coloring (Q5899384)

From MaRDI portal
Revision as of 16:52, 11 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5158291
Language Label Description Also known as
English
Exploring the complexity boundary between coloring and list-coloring
scientific article; zbMATH DE number 5158291

    Statements

    title
    Exploring the complexity boundary between coloring and list-coloring (English)
    0 references
    author
    Guillermo Durán
    0 references
    Javier Marenco
    0 references
    publication date
    29 May 2007
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C15
    0 references
    05C85
    0 references
    zbMATH DE Number
    5158291
    0 references
    zbMATH Keywords
    coloring
    0 references
    computational complexity
    0 references
    list-coloring
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5899384&oldid=10732653"
      Powered by MediaWiki