K_mP_n的全色数和邻强边色数

On The Total Coloring Number and The Adjacent Strong Edge Coloring Number of K_m_Pn

图染色的基本问题是确定各种染色法的色数.图G和H的直积GH是一类很重要的图积,本文给出了直积KmPn的全染色和邻强边染色的方法,得到其全色数和邻强边色数:χ'as(KmPn)=χt(KmPn)=2m-1(n>3).

The basic problem of graph coloring is how to obtain the chromatic number. The direct product of graph and is an important graph product. We provide the difinition of , then the total coloring and the adjacent strong edge coloring approaches was given for and obtained the chromatic number：