最大度为5的简单图的2-距离列表染色

List 2-distance coloring of graphs with maximum degree 5

通过对极小反例G的结构分析,利用权转移的方法,证明了:对于Δ(G)≤5的图G,若mad(G)<20/7,则χl2(G)≤10;若mad(G)<19/6,则χl2(G)≤11.这一结果改进了现有的部分结论.

For graph G with A（G）≤5, it was proved that if mad（G） 〈20/7, then X2 （G）≤10; if mad（G） 〈19/6, X2（G） ≤11. was by contradiction： a counterexample G, by using then The result obtained for minimal the method of discharging to show that G would not exist. These results improved some existed results.