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

From MaRDI portal
Revision as of 20:56, 10 July 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
Improved complexity results on \(k\)-coloring \(P_t\)-free graphs
scientific article

    Statements

    Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (English)
    0 references
    0 references
    30 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    4-coloring
    0 references
    5-coloring
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references