Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1112052 |
Changed an Item |
||
| Property / author | |||
| Property / author: Andre Raspaud / rank | |||
Normal rank | |||
Revision as of 06:59, 22 February 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
