(\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (Q432709)
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: ( + 1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles |
scientific article; zbMATH DE number 6053072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles |
scientific article; zbMATH DE number 6053072 |
Statements
(\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (English)
0 references
4 July 2012
0 references
total coloring
0 references
total choosability
0 references
list-total coloring
0 references
planar graphs
0 references
missing cycles
0 references
distance
0 references
0 references
0.8954103589057922
0 references
0.8649190664291382
0 references
0.8596131801605225
0 references
0.8563035130500793
0 references
