| 并图的边共色数 |
| |
| 引用本文： | 梁海鹏,刘信生. 并图的边共色数[J]. 甘肃科学学报, 2007, 19(3): 6-8 |
| |
| 作者姓名： | 梁海鹏 刘信生 |
| |
| 作者单位： | 西北师范大学,数学与信息科学学院,甘肃,兰州,730070 |
| |
| 摘 要： | 给出了并图的边共色数的上下界,以及并图的边共色数达到下界的充要条件和达到上界的充分和必要条件.并用具体实例说明了上下界的可达性.
|
| 关 键 词： | 边共色数 共色数 匹配 星 并图 |
| 文章编号： | 1004-0366（2007）03-0006-03 |
| 收稿时间： | 2006-11-10 |
| 修稿时间： | 2006-11-10 |
The Edge-Cochromatic Number of Union of Graphs |
| |
| LIANG Hai-peng,LIU Xin-sheng. The Edge-Cochromatic Number of Union of Graphs[J]. Journal of Gansu Sciences, 2007, 19(3): 6-8 |
| |
| Authors: | LIANG Hai-peng LIU Xin-sheng |
| |
| Affiliation: | College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China |
| |
| Abstract: | The upper and lower bounds on the edge-cochromatic number of union of graphs are given,and the conditions that edge-cochromatic number of union of graphs can reach the bounds are shown with concrete examples. |
| |
| Keywords: | edge-eoehromatie number eochromatie number matching star union of graphs |
| 本文献已被 维普 万方数据 等数据库收录！ |
