A note on 3-choosability of planar graphs (Q2824705)
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 6635231
| 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 6635231 |
Statements
6 October 2016
0 references
planar graph
0 references
cycles
0 references
distance
0 references
choosability
0 references
A note on 3-choosability of planar graphs (English)
0 references
0.9123648405075072
0 references
0.8935602903366089
0 references
0.874941349029541
0 references
0.8747133612632751
0 references
0.8724632263183594
0 references
