Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable (Q2800540)

From MaRDI portal
Revision as of 19:05, 11 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
Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable
scientific article

    Statements

    title
    Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable (English)
    0 references
    author
    Irena Penev
    0 references
    publication date
    15 April 2016
    0 references
    zbMATH Keywords
    strong perfect graph theorem
    0 references
    clique-chromatic number
    0 references

    Identifiers

    DOI
    10.1002/jgt.21870
    0 references
    Mathematics Subject Classification ID
    05C17
    0 references
    05C15
    0 references
    05C70
    0 references
    zbMATH DE Number
    6569674
    0 references
    OpenAlex ID
    W1557323685
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2800540&oldid=36242524"
    Powered by MediaWiki