\(k\)-forested choosability of planar graphs and sparse graphs (Q764887): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:25, 30 January 2024
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
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
