Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077)

From MaRDI portal
Revision as of 02:59, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
scientific article

    Statements

    title
    Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (English)
    0 references
    author
    Zdeněk Dvořák
    0 references
    Bernard Lidický
    0 references
    Riste Škrekovski
    0 references
    publication date
    15 December 2009
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    05C10
    0 references
    05C38
    0 references
    zbMATH DE Number
    5648120
    0 references
    zbMATH Keywords
    choosability
    0 references
    list-coloring
    0 references
    planar graphs
    0 references
    short cycles
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1045077&oldid=25951737"
    Powered by MediaWiki