Neighbor Sum Distinguishing Total Coloring of A Class of Sparse Graphs
In this paper,we study neighbor sum distinguishing total coloring of a class of sparse graphs and prove that the neighbor sum distinguishing total chrmatic number of this type of graphs doesn't exceed Δ+3 by applying the Combinatorial Nullstellensatz and discharge method.We obtain that the conjecture of neighbor sum distinguishing total chromatic number holds for these sparse graphs.
neighbor sum distinguishing total coloringCombinatorial Nullstellensatzdischarge method
国家科技期刊平台
NSTL
万方数据
维普
