Acyclic vertex coloring of graphs of maximum degree six

In this paper, we prove that every graph with maximum degree six is acyclically 10-colorable, thus improving the main result of Hervé Hocquard (2011).