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).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have