On the total choosability of planar graphs and of sparse graphs (Q407575): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2010.07.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2010.07.007 / rank | |||
Normal rank | |||
Latest revision as of 16:41, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the total choosability of planar graphs and of sparse graphs |
scientific article |
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
