Key points are not available for this paper at this time.
The linear arboricity of a graph is the minimum number of linear forests that partition the edges of . In 1981, Akiyama, Exoo and Harary conjectured that for any simple graph . A graph is 1-planar if it can be drawn in the plane so that each edge has at most one crossing. An IC-planar graph is a 1-planar graph satisfying the condition that each vertex is incident with at most one crossing edge. It is shown in this paper that every IC-planar graph with maximum degree has .
Li et al. (Sun,) studied this question.