关于一类二部图的均匀邻点可区别全染色

On the Equitable Adjacent Vertex-distinguishing Total Coloring of k-regular Bipartite Graphs

若图的邻点可区别全染色的各色所染元素数之差不超过1,则称该染色法为图的均匀邻点可区别全染色,而所用的最少颜色数称为该图的均匀邻点可区别全色数.本文给出了一类二部图的均匀邻点可区别全染色数.

We propose the notion of equitable adjacent vertex-distinguishing total coloring of graphs, k-regular bipartite graphs is proved that the charmotic number of equital adjacent vertex-distinguish total coloring is k＋2.