Linear choosability of sparse graphs (Q2275448)
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: Linear choosability of sparse graphs |
scientific article; zbMATH DE number 5937068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear choosability of sparse graphs |
scientific article; zbMATH DE number 5937068 |
Statements
Linear choosability of sparse graphs (English)
0 references
9 August 2011
0 references
linear coloring
0 references
list coloring
0 references
planar graph
0 references
discharging method
0 references
maximum average degree
0 references
0.9601386189460754
0 references
0.916796624660492
0 references
0.9112176299095154
0 references
0.8761304616928101
0 references
0.8402957916259766
0 references
