Complexity of conditional colorability of graphs (Q1003864)

From MaRDI portal
Revision as of 03:39, 29 June 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 conditional colorability of graphs
scientific article

    Statements

    title
    Complexity of conditional colorability of graphs (English)
    0 references
    author
    Xiangmei Yao
    0 references
    Wenli Zhou
    0 references
    Xue Liang Li
    0 references
    Hajo J. Broersma
    0 references
    publication date
    4 March 2009
    0 references
    zbMATH DE Number
    5523293
    0 references
    zbMATH Keywords
    vertex coloring
    0 references
    conditional coloring
    0 references
    (Conditional) chromatic number
    0 references
    algorithm
    0 references
    complexity
    0 references
    \(NP\)-complete
    0 references
    OpenAlex ID
    W2149858405
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1003864&oldid=35096623"
    Powered by MediaWiki