Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Ying Qian Wang / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Hua Jing Lu / rank | |||
Normal rank | |||
Revision as of 16:07, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable |
scientific article |
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
