A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6637642
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \((3,1)^\ast\)-choosable theorem on planar graphs |
scientific article; zbMATH DE number 6637642 |
Statements
A \((3,1)^\ast\)-choosable theorem on planar graphs (English)
0 references
12 October 2016
0 references
planar graphs
0 references
improper choosability
0 references
cycle
0 references
0 references
0.9495221376419068
0 references
0.8882973790168762
0 references
0.8856209516525269
0 references
