Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.08.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966005013 / rank | |||
Normal rank | |||
Revision as of 20:36, 19 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
