稀疏图的邻和可区别全列表染色
Neighborhood sum discriminative full list coloring of sparse graphs
童思鹏 1陈东2
作者信息
- 1. 浙江师范大学 数学科学学院,浙江 金华 321004
- 2. 浙江师范大学 行知学院,浙江 兰溪 321100
- 折叠
摘要
通过分析极小反例的结构,运用权转移方法,证明了最大度Δ(G)≥8 且最大平均度小于 3.2 的图G的邻和可区别全选择数不超过Δ(G)+2.
Abstract
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.
关键词
稀疏图/邻和可区别列表全染色/最大平均度/权转移Key words
sparse graph/neighborhood sum discriminative list total coloring/maximum average degree/discharging method引用本文复制引用
出版年
2025
NETL
NSTL
万方数据