A note on the minimum number of choosability of planar graphs (Q266020)
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 6567797
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the minimum number of choosability of planar graphs |
scientific article; zbMATH DE number 6567797 |
Statements
A note on the minimum number of choosability of planar graphs (English)
0 references
13 April 2016
0 references
choosability
0 references
planar graph
0 references
cycle
0 references
list edge coloring
0 references
0 references
0 references
0 references
0.9400290250778198
0 references
0.8597003817558289
0 references
0.8582882881164551
0 references
0.8576574921607971
0 references
0.8565055131912231
0 references
