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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable |
scientific article |
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
