三类完全三部图的邻强边染色

Adjacent Strong Edge Coloring of Three Class of Complete 3-Partite Graphs

文章研究了完全三部图G=kl,m,n(1≤l≤m≤n)在1≤l≤3时的邻强边染色问题,用构造性方法给出了其邻强边色数.论证了对1≤l≤3的完全三部图有Δ(G)≤χ′as(G)≤Δ(G)+2成立.

In this paper,we study the problem of complete 3-partite graph G=kl,m,n（1≤l≤m≤n）′s adjacent strong edge coloring when 1≤l≤3,and prove that Δ（G）≤χ′as（G）≤Δ（G）＋2 when 1≤l≤3.