A note on the not 3-choosability of some families of planar graphs (Q845679)
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 the not 3-choosability of some families of planar graphs |
scientific article; zbMATH DE number 5664460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the not 3-choosability of some families of planar graphs |
scientific article; zbMATH DE number 5664460 |
Statements
A note on the not 3-choosability of some families of planar graphs (English)
0 references
29 January 2010
0 references
combinatorial problems
0 references
coloring
0 references
list-coloring
0 references
choosability
0 references
0 references
0.897792637348175
0 references
0.8663384318351746
0 references
0.8638100624084473
0 references
0.8631938695907593
0 references
