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 this page instead for the normal view: Acyclic coloring of graphs of maximum degree five: nine colors are enough |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Acyclic coloring of graphs of maximum degree five: nine colors are enough |
scientific article |
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
