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

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

作　　者：雷波[1] 

机构地区：[1]九江学院理学院,江西九江332005

出　　处：《九江学院学报（自然科学版）》2012年第4期58-60,共3页Journal of Jiujiang University：Natural Science Edition

摘　　要：图染色的基本问题是确定各种染色法的色数.图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：

关 键 词：完全图 直积 全染色 邻强边染色 色数 

分 类 号：O157.5[理学—数学]