Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155)
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 5648181
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable |
scientific article; zbMATH DE number 5648181 |
Statements
Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (English)
0 references
15 December 2009
0 references
planar graph
0 references
cycle
0 references
choosability
0 references
colorability
0 references
0.99008906
0 references
0.94764286
0 references
0.94752955
0 references
0.9447668
0 references
0.9370182
0 references
0 references
0.9327876
0 references
