Abstract
A graph G is called an IC-planar graph if it can be embedded in the plane so that every edge is crossed by at most one other edge and every vertex is incident to at most one crossing edge. In this paper, we prove that every IC-planar graph is acyclically 10-colorable. Moreover, an IC-planar graph of the acyclic chromatic number 6 is constructed.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
