2-距离染色的可选性

The choosability of the 2-distance coloring of a graph

研究了简单图的2-距离列表染色问题.运用权转移方法,证明了对于Δ(G)=6的简单图G,若最大平均度mad(G)<2+16/25,则G是8-2-距离可选的;若mad(G)<2+4/5,则G是9-2-距离可选的.该结果进一步拓展了Δ(G)=6的图类的2-距离可选性.

The problem of the choosability of the 2-distance coloring of a graph G with Δ（ G） = 6 was studied.Using the Discharging method to prove that ch2（ G） ≤8 if the maximum average degree mad（ G） 2 ＋16/25,ch2（ G） ≤9 if mad（ G） 2 ＋4/5 for Δ（ G） = 6. It generalized the choosability of the list 2-distance coloring of a graph G with Δ（ G） = 6.