Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077)
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 5648120
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without 3-, 7-, and 8-cycles are 3-choosable |
scientific article; zbMATH DE number 5648120 |
Statements
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (English)
0 references
15 December 2009
0 references
choosability
0 references
list-coloring
0 references
planar graphs
0 references
short cycles
0 references
0.9243658781051636
0 references
0.9229047298431396
0 references
0.9091944098472596
0 references
0.8905854225158691
0 references
