Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q56390803, #quickstatements; #temporary_batch_1711574657256 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56390803 / rank | |||
Normal rank | |||
Revision as of 00:03, 28 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
