Acyclic 3-choosability of planar graphs without cycles of length from 4 to 12 (Q3115193)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6007833
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Acyclic 3-choosability of planar graphs without cycles of length from 4 to 12 |
scientific article; zbMATH DE number 6007833 |
Statements
20 February 2012
0 references
plane graph
0 references
acyclic coloring
0 references
acyclic choosability
0 references
measure of sparseness
0 references
0.9790409207344056
0 references
0.9252687096595764
0 references
0.9094069600105286
0 references
0.9086150527000428
0 references
0.9034358859062196
0 references
