| 最大度等于5的图的强边色数 |
| |
| 引用本文： | 柳顺义,陈祥恩,刘信生. 最大度等于5的图的强边色数[J]. 西北师范大学学报(自然科学版), 2007, 43(2): 16-19 |
| |
| 作者姓名： | 柳顺义 陈祥恩 刘信生 |
| |
| 作者单位： | 西北师范大学数学与信息科学学院,甘肃兰州730070 |
| |
| 摘 要： | 最大度等于5的图的强边色数至多为38.
|
| 关 键 词： | 强边色数 贪婪着色算法 导出匹配 最大度 |
| 文章编号： | 1001-988X（2007）02-0016-04 |
| 修稿时间： | 2006-05-182006-12-05 |
The strong chromatic index of graphs with maximum degree 5 |
| |
| LIU Shun-yi,CHEN Xiang-en,LIU Xin-sheng. The strong chromatic index of graphs with maximum degree 5[J]. Journal of Northwest Normal University Natural Science (Bimonthly), 2007, 43(2): 16-19 |
| |
| Authors: | LIU Shun-yi CHEN Xiang-en LIU Xin-sheng |
| |
| Affiliation: | College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, Gansu, China |
| |
| Abstract: | A graph with maximum degree 5 has a strong edge colouring with at most 38 colours. |
| |
| Keywords: | strong chromatic index greedy colouring algorithm induced matching maximum degree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
