Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043): Difference between revisions
From MaRDI portal
Latest revision as of 07:03, 13 November 2024
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