Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles

summary:Let $G=(V(G),E(G))$ be a simple graph and $E_{G}(v)$ denote the set of edges incident with a vertex $v$. A neighbor sum distinguishing (NSD) total coloring $\phi $ of $G$ is a proper total coloring of $G$ such that $\sum _{z\in E_{G}(u)\cup \{u\}}\phi (z)\neq \sum _{z\in E_{G}(v)\cup \{v\}}\phi (z)$ for each edge $uv\in E(G)$. Pilśniak and Woźniak asserted in 2015 that each graph with maximum degree $\Delta $ admits an NSD total $(\Delta +3)$-coloring. We prove that the list version of this conjecture holds for any IC-planar graph with $\Delta \geq 11$ but without $5$-cycles by applying the Combinatorial Nullstellensatz