Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2007.08.022 / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/ipl/FertinR08 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2007.08.022 / rank | |||
Normal rank | |||
Latest revision as of 07:21, 18 December 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
