\(k\)-forested choosability of graphs with bounded maximum average degree (Q1954018)

From MaRDI portal
Revision as of 00:08, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
\(k\)-forested choosability of graphs with bounded maximum average degree
scientific article

    Statements

    \(k\)-forested choosability of graphs with bounded maximum average degree (English)
    0 references
    0 references
    0 references
    0 references
    12 June 2013
    0 references
    \(k\)-forested coloring
    0 references
    linear coloring
    0 references
    maximum average degree
    0 references

    Identifiers