| 完全图的广义Mycielski图的邻强边染色 |
| |
| 引用本文： | 洪燕君,晁福刚. 完全图的广义Mycielski图的邻强边染色[J]. 数学的实践与认识, 2012, 42(7): 256-258 |
| |
| 作者姓名： | 洪燕君 晁福刚 |
| |
| 作者单位： | 1. 石河子大学 师范学院,新疆石河子,832000
2. 华东师范大学数学系,上海,200241 |
| |
| 摘 要： | 对|V(G)|≥3的连通图G,若κ-正常边染色法满足相邻点的色集合不相同,则称该染色法为κ-邻强边染色,其最小的κ称为图G的邻强边色数。张忠辅等学者猜想:对|V(G)|≥3的连通图G,G≠C_5其邻强边色数至多为△(G)+2,利用组合分析的方法给出了完全图的广义Mycielski图的邻强边色数,从而验证了图的邻强边染色猜想对于此类图成立。
|
| 关 键 词： | 邻强边染色 邻强边色数 Mycielski图 |
On the Adjacent Strong Edge Coloring of General Mycielski Graph Mn(Km) |
| |
| Hong Yan-jun , CHAO Fu-gang. On the Adjacent Strong Edge Coloring of General Mycielski Graph Mn(Km)[J]. Mathematics in Practice and Theory, 2012, 42(7): 256-258 |
| |
| Authors: | Hong Yan-jun CHAO Fu-gang |
| |
| Affiliation: | 1.Department of Curriculum and Teaching,Normal College of Shihezi University,Shihezi 832000,China) (2.Department of Mathematics,East China Normal University,Shanghai 200241,China) |
| |
| Abstract: | 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Δ(G) +2.We obtained the adjacent strong edge chromatic number of general Mycielski graph Mn(Km),thus verified the conjecture is true for this type. |
| |
| Keywords: | adjacent strong edge coloring adjacent strong edge chromatic number general Mycielski graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
