完全图的广义Mycielski图的邻强边染色  

On the Adjacent Strong Edge Coloring of General Mycielski Graph M_n(K_m)

作　　者：洪燕君[1] 晁福刚[2] 

机构地区：[1]石河子大学师范学院,新疆石河子832000 [2]华东师范大学数学系,上海200241

出　　处：《数学的实践与认识》2012年第7期256-258,共3页Mathematics in Practice and Theory

基　　金：国家自然科学基金(10771091)

摘　　要：对|V(G)|≥3的连通图G,若κ-正常边染色法满足相邻点的色集合不相同,则称该染色法为κ-邻强边染色,其最小的κ称为图G的邻强边色数。张忠辅等学者猜想:对|V(G)|≥3的连通图G,G≠C_5其邻强边色数至多为△(G)+2,利用组合分析的方法给出了完全图的广义Mycielski图的邻强边色数,从而验证了图的邻强边染色猜想对于此类图成立。For a connected graph with ｜V（G）｜ ≥ 3, if a k-proper edge coloring of G satisfy two adjacent vertices with different set of colors, then it is called k-adjacent strong edge coloring of G, and the minimum k is called adjacent strong edge chromatic number. Zhang et al conjectured that the adjacent strong edge chromatic number of graphs, not 5-cycle, is at most A（G） ＋ 2. We obtained the adjacent strong edge chromatic number of general Myeielski graph Mn（Km）, thus verified the conjecture is true for this type.

关 键 词：邻强边染色 邻强边色数 MYCIELSKI图 

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