On the total choosability of planar graphs and of sparse graphs (Q407575)
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: On the total choosability of planar graphs and of sparse graphs |
scientific article; zbMATH DE number 6018489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the total choosability of planar graphs and of sparse graphs |
scientific article; zbMATH DE number 6018489 |
Statements
On the total choosability of planar graphs and of sparse graphs (English)
0 references
27 March 2012
0 references
combinatorial problems
0 references
total coloring
0 references
total choosability
0 references
planar graphs
0 references
cycle-free
0 references
maximum average degree
0 references
mad
0 references
0 references
0.9036462306976318
0 references
0.8815553188323975
0 references
0.8765472769737244
0 references
0.8664802312850952
0 references
