江西科学2024，Vol.42Issue(2)：227-230,4.DOI:10.13990/j.issn1001-3679.2024.02.001
一类稀疏图的邻和可区别全染色
Neighbor Sum Distinguishing Total Coloring of A Class of Sparse Graphs
摘要
Abstract
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.关键词
邻和可区别全染色/组合零点定理/权转移法Key words
neighbor sum distinguishing total coloring/Combinatorial Nullstellensatz/discharge method分类
数理科学引用本文复制引用
樊玉花,张东翰..一类稀疏图的邻和可区别全染色[J].江西科学,2024,42(2):227-230,4.基金项目
商洛学院大学生创新创业训练计划项目(S202111396050) （S202111396050）
商洛学院博士科研启动项目(22SKY112). （22SKY112）
