Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11 (Q890814): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:07, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11 |
scientific article |
Statements
Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11 (English)
0 references
16 November 2015
0 references
acyclic coloring
0 references
planar graph
0 references
forbidden cycles
0 references
