Title of article
Acyclic vertex coloring of graphs of maximum degree six
Author/Authors
Zhao، نويسنده , , Yancai and Miao، نويسنده , , Lianying and Pang، نويسنده , , Shiyou and Song، نويسنده , , Wenyao، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
6
From page
17
To page
22
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).
Keywords
graph coloring , Bounded degree graphs , Acyclic coloring
Journal title
Discrete Mathematics
Serial Year
2014
Journal title
Discrete Mathematics
Record number
1600645
Link To Document