Neighbor sum distinguishing total choosability of triangle-free IC-planar graphs
Fugang Chao, Chao Li, Donghan Zhang · ScienceAsia · 2023
is called a neighbor sum distinguishing (NSD) total coloring.Pilśniak and Woźniak conjectured that every graph with maximum degree ∆ exists an NSD total (∆ + 3)-coloring.In this paper, we improve the results of Song et al [Acta Math Sin (Engl Ser) 36(2020):292-304] to the list version by applying the combinatorial nullstellensatz.