Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.022 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052022404 / rank | |||
Normal rank | |||
Revision as of 03:00, 20 March 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
