Abstract
A proper total k-coloring of G with for each is called a total neighbor sum distinguishing k-coloring, where . Pilśniak and Woźniak conjectured that every graph with maximum degree exists a total neighbor sum distinguishing -coloring. In this paper, we proved that any IC-planar graph with satisfies this conjecture, which improves the result of Song and Xu.