Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable |
scientific article; zbMATH DE number 5777514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable |
scientific article; zbMATH DE number 5777514 |
Statements
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (English)
0 references
1 September 2010
0 references
combinatorial problems
0 references
acyclic choosability
0 references
planar graphs
0 references
forbidden cycles
0 references
0 references
0.9563223719596864
0 references
0.9446424245834352
0 references
0.938760221004486
0 references
0.9361544251441956
0 references
0.932128608226776
0 references
