\(k\)-forested choosability of planar graphs and sparse graphs (Q764887): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2011.10.031 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1991031649 / rank | |||
Normal rank |
Revision as of 03:35, 20 March 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