\(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884)

From MaRDI portal
Revision as of 05:13, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
\(H\)-colouring \(P_t\)-free graphs in subexponential time
scientific article

    Statements

    title
    \(H\)-colouring \(P_t\)-free graphs in subexponential time (English)
    0 references
    author
    Carla Groenland
    0 references
    Karolina Okrasa
    0 references
    Sophie Spirkl
    0 references
    Paweł Rzążewski
    0 references
    Alexander D. Scott
    0 references
    P. D. Seymour
    0 references
    publication date
    5 September 2019
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    05C85
    0 references
    05A15
    0 references
    zbMATH DE Number
    7101890
    0 references
    zbMATH Keywords
    colouring
    0 references
    \(P_t\)-free graph
    0 references
    subexponential-time algorithm
    0 references
    partition function
    0 references
    path-decomposition
    0 references
    OpenAlex ID
    W2963267430
    0 references
    arXiv ID
    1803.05396
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2322884&oldid=33499345"
    Powered by MediaWiki