Planar graphs without 4- and 5-cycles are acyclically 4-choosable (Q1949098)
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 6157655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without 4- and 5-cycles are acyclically 4-choosable |
scientific article; zbMATH DE number 6157655 |
Statements
Planar graphs without 4- and 5-cycles are acyclically 4-choosable (English)
0 references
25 April 2013
0 references
planar graphs
0 references
acyclic coloring
0 references
choosability
0 references
cycle
0 references
0.9564449787139891
0 references
0.9516726732254028
0 references
0.9504910707473756
0 references
0.9454845190048218
0 references
0.9438790678977966
0 references
