A sufficient condition for planar graphs to be (3,1)-choosable (Q1679498)
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: A sufficient condition for planar graphs to be (3,1)-choosable |
scientific article; zbMATH DE number 6804412
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for planar graphs to be (3,1)-choosable |
scientific article; zbMATH DE number 6804412 |
Statements
A sufficient condition for planar graphs to be (3,1)-choosable (English)
0 references
9 November 2017
0 references
planar graphs
0 references
choosability with separation
0 references
list coloring
0 references
cycles
0 references
