A note on 3-choosability of planar graphs (Q2380076)
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 5686501
| 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 5686501 |
Statements
A note on 3-choosability of planar graphs (English)
0 references
24 March 2010
0 references
combinatorial problems
0 references
planar graph
0 references
cycle
0 references
choosability
0 references
0 references
0.9281947016716005
0 references
0.9218069911003112
0 references
0.9187189340591432
0 references
0.9123648405075072
0 references
0.9095337986946106
0 references
