\(k\)-forested choosability of planar graphs and sparse graphs (Q764887)

From MaRDI portal
Revision as of 16:48, 13 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
\(k\)-forested choosability of planar graphs and sparse graphs
scientific article

    Statements

    \(k\)-forested choosability of planar graphs and sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    16 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    \(k\)-forested coloring
    0 references
    linear coloring
    0 references
    frugal coloring
    0 references
    maximum average degree
    0 references
    planar graph
    0 references