若干冠图的邻和可区别全可选性

Neighbor Sum Distinguishing Total Choosability of Some Corona Graphs

根据冠图的结构特征,构造了一种染色方案,得到对于有最大度限制的子立方体图和子立方体图的冠图,可平面图和子立方体图的冠图以及可平面图和可平面图的冠图列表邻和可区别全染色猜想成立.进而,对于上述图邻和可区别全染色猜想亦成立.

A coloring method according to the structure of the corona graph is given,to show that the list neighbor sum distinguishing total coloring conjecture holds for the corona graph of a subcubic graph and a subcubic graph,the corona graph of a planar graph and a subcubic graph,the corona graph of a planar graph and a planar graph with maximum degree restrictions.Furthermore,the neighbor sum distinguishing total coloring conjecture holds for the above graphs.