Article ID Journal Published Year Pages File Type
4647199 Discrete Mathematics 2014 6 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Acyclic vertex coloring of graphs of maximum degree six
Authors
, , , ,