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).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
