Author/Authors :
Zhao، نويسنده , , Yancai and Miao، نويسنده , , Lianying and Pang، نويسنده , , Shiyou and Song، نويسنده , , Wenyao، نويسنده ,
Abstract :
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).
