Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2009.08.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2009.08.005 / rank | |||
Normal rank | |||
Latest revision as of 14:47, 10 December 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
