Linear choosability of sparse graphs (Q2275448)

From MaRDI portal
Revision as of 04:21, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Linear choosability of sparse graphs
scientific article

    Statements

    title
    Linear choosability of sparse graphs (English)
    0 references
    author
    Daniel W. Cranston
    0 references
    Gexin Yu
    0 references
    publication date
    9 August 2011
    0 references
    zbMATH Keywords
    linear coloring
    0 references
    list coloring
    0 references
    planar graph
    0 references
    discharging method
    0 references
    maximum average degree
    0 references

    Identifiers

    zbMATH DE Number
    5937068
    0 references
    OpenAlex ID
    W2141381908
    0 references
    arXiv ID
    1007.1615
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2275448&oldid=33489130"
    Powered by MediaWiki