Planar graphs without 4- and 5-cycles are acyclically 4-choosable (Q1949098): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1112052 |
||
| Property / author | |||
| Property / author: Andre Raspaud / rank | |||
Revision as of 06:58, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without 4- and 5-cycles are acyclically 4-choosable |
scientific article |
Statements
Planar graphs without 4- and 5-cycles are acyclically 4-choosable (English)
0 references
25 April 2013
0 references
planar graphs
0 references
acyclic coloring
0 references
choosability
0 references
cycle
0 references
