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 the normal view instead:
scientific article; zbMATH DE number 6804412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.92902010679245
0 references
0.9233028888702391
0 references
0.9172163009643556
0 references
0.9119004607200624
0 references
0.8861715197563171
0 references
