\(k\)-forested choosability of planar graphs and sparse graphs (Q764887)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \(k\)-forested choosability of planar graphs and sparse graphs |
scientific article; zbMATH DE number 6015216
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(k\)-forested choosability of planar graphs and sparse graphs |
scientific article; zbMATH DE number 6015216 |
Statements
\(k\)-forested choosability of planar graphs and sparse graphs (English)
0 references
16 March 2012
0 references
\(k\)-forested coloring
0 references
linear coloring
0 references
frugal coloring
0 references
maximum average degree
0 references
planar graph
0 references
