稀疏图的邻和可区别全列表染色  

Neighborhood sum discriminative full list coloring of sparse graphs

作　　者：童思鹏 陈东[2] TONG Sipeng;CHEN Dong(School of Mathematical Sciences,Zhejiang Normal University,Jinhua 321004,China;Xingzhi College,Zhejiang Normal University,Lanxi 321100,China)

机构地区：[1]浙江师范大学数学科学学院,浙江金华321004 [2]浙江师范大学行知学院,浙江兰溪321100

出　　处：《浙江师范大学学报（自然科学版）》2025年第1期30-35,共6页Journal of Zhejiang Normal University:Natural Sciences

基　　金：浙江省公益技术研究计划资助项目(LY20A010015)。

摘　　要：通过分析极小反例的结构,运用权转移方法,证明了最大度Δ(G)≥8且最大平均度小于3.2的图G的邻和可区别全选择数不超过Δ(G)+2.It was proved for a simple graph G with maximum average degree less than 3.2 and maximum degree Δ(G)≥8,the neighborhood sum discriminative total choice number was estimated at most Δ(G)+2.The proof approach was based on structural analysis and discharging method.

关 键 词：稀疏图 邻和可区别列表全染色 最大平均度 权转移 

分 类 号：O157.5[理学—数学]