Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486)

From MaRDI portal
Revision as of 21:25, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Improved complexity results on \(k\)-coloring \(P_t\)-free graphs
scientific article

    Statements

    title
    Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (English)
    0 references
    author
    Shenwei Huang
    0 references
    publication date
    30 September 2015
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    05C60
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6487478
    0 references
    zbMATH Keywords
    4-coloring
    0 references
    5-coloring
    0 references
    OpenAlex ID
    W1695953772
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q499486&oldid=31751927"
    Powered by MediaWiki