A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \((3,1)^\ast\)-choosable theorem on planar graphs |
scientific article |
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
