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