Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2009.04.010 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2009.04.010 / rank | |||
Normal rank | |||
Latest revision as of 14:39, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without 3-, 7-, and 8-cycles are 3-choosable |
scientific article |
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
