A sufficient condition for a planar graph to be 3-choosable (Q2380013)

From MaRDI portal
Revision as of 15:25, 2 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
A sufficient condition for a planar graph to be 3-choosable
scientific article

    Statements

    title
    A sufficient condition for a planar graph to be 3-choosable (English)
    0 references
    author
    Liang Shen
    0 references
    Ying Qian Wang
    0 references
    publication date
    24 March 2010
    0 references
    zbMATH DE Number
    5686446
    0 references
    zbMATH Keywords
    combinatorial problems
    0 references
    planar graph
    0 references
    cycle
    0 references
    choosability
    0 references
    OpenAlex ID
    W2031219849
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2380013&oldid=35159220"
    Powered by MediaWiki