Why Almost All k-Colorable Graphs Are Easy (Q3590926)

From MaRDI portal
Revision as of 04:22, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Why Almost All k-Colorable Graphs Are Easy
scientific article

    Statements

    title
    Why Almost All k-Colorable Graphs Are Easy (English)
    0 references
    author
    Amin Coja-Oghlan
    0 references
    Michael Krivelevich
    0 references
    Dan Vilenchik
    0 references
    published in
    STACS 2007
    0 references
    publication date
    3 September 2007
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    05C85
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5186502
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3590926&oldid=17004884"
    Powered by MediaWiki