| 轮形图的全着色 |
| |
| 引用本文： | 杨鹏辉.轮形图的全着色[J].海南大学学报(自然科学版),2011,29(1):8-10,19. |
| |
| 作者姓名： | 杨鹏辉 |
| |
| 作者单位： | 安徽财经大学,统计与应用数学学院,安徽,蚌埠,233030 |
| |
| 摘 要： | 图G(超图H)的全着色是指同时给图中的顶点和边进行着色,使相关联或相邻的元素间着不同的颜色,而使用的最少的颜色数就称为全色数,记为xT(G)(xT(H)).超图的全着色又可以分成弱全着色和强全着色2种情况.本文主要讨论超图中轮形图W(v)的全着色性质,并得到具体的强全色数和弱全色数,xWT(W(v))=△+1,xST(...
|
| 关 键 词： | 轮形图 全着色 弱全色数 强全色数 |
Total Coloring of Wheels |
| |
| YANG Peng-hui.Total Coloring of Wheels[J].Natural Science Journal of Hainan University,2011,29(1):8-10,19. |
| |
| Authors: | YANG Peng-hui |
| |
| Institution: | YANG Peng-hui (Department of Statistic and Applied Mathematics,Anhui University of Finance and Economics,Bengbu 233030,China) |
| |
| Abstract: | The total chromatic number χT(H) of hypergraph H is the minimum number of colors needed to color the vertices and edges of H so that the incident or adjacent elements have distinct colors.The total coloring of hypergraph contains weak total coloring and strong total coloring.In the paper,the characteristics of the total colorings of wheel W(v) were discussed,and the chromatic numbers of them,χWT(W(v))=Δ+1,χST(W(v))= M+1 were obtained. |
| |
| Keywords: | wheels total coloring weak total chromatic number strong total chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
