Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11 (Q890814)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6508937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11 |
scientific article; zbMATH DE number 6508937 |
Statements
Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11 (English)
0 references
16 November 2015
0 references
acyclic coloring
0 references
planar graph
0 references
forbidden cycles
0 references
0.9790409207344056
0 references
0.925984799861908
0 references
0.9126060605049132
0 references
0.9112210869789124
0 references
0.9061716198921204
0 references
