Planar graphs without 4-cycles are acyclically 6-choosable (Q3652536)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without 4-cycles are acyclically 6-choosable |
scientific article |
Statements
Planar graphs without 4-cycles are acyclically 6-choosable (English)
0 references
18 December 2009
0 references
acyclic coloring
0 references
choosability
0 references
list coloring
0 references
planar graphs
0 references
