A note on 3-choosability of planar graphs (Q3073243)
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 note on 3-choosability of planar graphs |
scientific article; zbMATH DE number 5846192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on 3-choosability of planar graphs |
scientific article; zbMATH DE number 5846192 |
Statements
5 February 2011
0 references
choosability
0 references
planar graph
0 references
cycle
0 references
0.9519437551498412
0 references
0.9303512573242188
0 references
0.918152153491974
0 references
0.9095337986946106
0 references
0.9026745557785034
0 references
