On the complexity of a restricted list-coloring problem (Q1296975)

From MaRDI portal
Revision as of 20:30, 28 May 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
On the complexity of a restricted list-coloring problem
scientific article

    Statements

    title
    On the complexity of a restricted list-coloring problem (English)
    0 references
    author
    Moshe Dror
    0 references
    Gerd Finke
    0 references
    Sylvain Gravier
    0 references
    Wiesław X. Kubiak
    0 references
    publication date
    3 August 1999
    0 references
    zbMATH Keywords
    restricted list-coloring
    0 references
    polynomial algorithm
    0 references

    Identifiers

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