@article{Chao2023, 
author = {Fugang Chao and Donghan Zhang},
title = {Neighbor sum distinguishing total choice number of IC-planar graphs with restrictive conditions},
year = {2023},
journal = {AIMS Mathematics},
volume = {8},
number = {6},
pages = {13637-13646},
keywords = {IC-planar graphs, neighbor sum distinguishing total choice number, combinatorial nullstellensatz, discharging method},
url = {https://www.sciopen.com/article/10.3934/math.2023692},
doi = {10.3934/math.2023692},
abstract = {A neighbor sum distinguishing (NSD) total coloring    ϕ of    G is a proper total coloring such that        ∑          z      ∈              E                  G                    (      u      )      ∪      {      u      }        ϕ  (  z  )  ≠      ∑          z      ∈              E                  G                    (      v      )      ∪      {      v      }        ϕ  (  z  ) for each edge    u  v  ∈  E  (  G  ). Pilśniak and Woźniak asserted that each graph with a maximum degree    Δ admits an NSD total    (  Δ  +  3  )-coloring in 2015. In this paper, we prove that the list version of this conjecture holds for any IC-planar graph with    Δ  ≥  10 but without five cycles by applying the discharging method, which improves the result of Zhang (NSD list total coloring of IC-planar graphs without five cycles).}
}