Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957): Difference between revisions
From MaRDI portal
Set profile property. |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:49, 6 March 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
