Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043)
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 5686474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Acyclic coloring of graphs of maximum degree five: nine colors are enough |
scientific article; zbMATH DE number 5686474 |
Statements
Acyclic coloring of graphs of maximum degree five: nine colors are enough (English)
0 references
24 March 2010
0 references
acyclic chromatic number
0 references
acyclic coloring algorithm
0 references
maximum degree 5
0 references
graph algorithms
0 references
0.9375213980674744
0 references
0.9142308235168456
0 references
0.911289930343628
0 references
0.894973874092102
0 references
