Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (Q629363)
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: Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable |
scientific article; zbMATH DE number 5862859
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable |
scientific article; zbMATH DE number 5862859 |
Statements
Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (English)
0 references
9 March 2011
0 references
planar graph
0 references
cycle
0 references
choosability
0 references
coloring
0 references
