On the Complexity of Ordered Colorings (Q3629479)

From MaRDI portal
Revision as of 21:30, 16 October 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
On the Complexity of Ordered Colorings
scientific article

    Statements

    title
    On the Complexity of Ordered Colorings (English)
    0 references
    DOI
    10.1137/060676222
    0 references
    author
    Arvind Kumar Gupta
    0 references
    Jan van den Heuvel
    0 references
    Ján Maňuch
    0 references
    Ladislav Stacho
    0 references
    Xiaohong Zhao
    0 references
    publication date
    27 May 2009
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    68Q25
    0 references
    05C85
    0 references
    zbMATH DE Number
    5558442
    0 references
    zbMATH Keywords
    graph coloring
    0 references
    ordered coloring
    0 references
    directed graph homomorphism
    0 references
    complexity
    0 references
    NP-completeness
    0 references
    polynomial algorithm
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3629479&oldid=8057972"
      Powered by MediaWiki