A sufficient condition for planar graphs to be acyclically 5-choosable (Q2888884)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A sufficient condition for planar graphs to be acyclically 5-choosable |
scientific article; zbMATH DE number 6042704
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sufficient condition for planar graphs to be acyclically 5-choosable |
scientific article; zbMATH DE number 6042704 |
Statements
A sufficient condition for planar graphs to be acyclically 5-choosable (English)
0 references
4 June 2012
0 references
acyclic coloring
0 references
acyclic choosability
0 references
planar graph
0 references
intersecting triangles
0 references
0.960060715675354
0 references
0.9590776562690736
0 references
0.95029479265213
0 references
0.949768364429474
0 references
