Colouring perfect graphs with bounded clique number (Q345123)

From MaRDI portal
Revision as of 00:39, 13 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
Colouring perfect graphs with bounded clique number
scientific article

    Statements

    title
    Colouring perfect graphs with bounded clique number (English)
    0 references
    author
    Maria Chudnovsky
    0 references
    Aurélie Lagoutte
    0 references
    Sophie Spirkl
    0 references
    P. D. Seymour
    0 references
    publication date
    25 November 2016
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    05C17
    0 references
    05C70
    0 references
    zbMATH DE Number
    6656189
    0 references
    zbMATH Keywords
    colouring algorithm
    0 references
    perfect graph
    0 references
    balanced skew partition
    0 references
    OpenAlex ID
    W2525388293
    0 references
    arXiv ID
    1707.03747
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q345123&oldid=36290078"
    Powered by MediaWiki