几类图的2-强边染色

On 2-strong edge coloring of some graphs

研究了树、圈、完全二部图和轮图的2-强边染色问题.对于树,给出了2-强边色数等于最大顶点度加1的充分条件;对于圈、完全二部图及轮图,求出了2-强边色数,并给出了相应的染色方案.

This paper discussed the 2-strong edge coloring of some graphs,such as trees,cycles,complete bipartite graphs and wheels.For any tree,the paper proposed a sufficient condi- tion of 2-strong edge coloring number equals to the maximum degree plus one,and obtained the 2-strong edge coloring number of cycles,complete bipartite graphs and wheels,and the color- ing schemes of these graphs are given.