Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957): Difference between revisions
From MaRDI portal
Latest revision as of 03:17, 3 July 2024
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