| 单圈图的邻强边染色 |
| |
| 引用本文： | 赵新梅,陈祥恩.单圈图的邻强边染色[J].兰州铁道学院学报,2005,24(6):138-140. |
| |
| 作者姓名： | 赵新梅 陈祥恩 |
| |
| 作者单位： | 西北师范大学,数学与信息科学学院,甘肃,兰州,730070;西北师范大学,数学与信息科学学院,甘肃,兰州,730070 |
| |
| 摘 要： | 设G是阶数不小于3的简单连通图,G的k-正常边染色称为是邻强的,如果G的任意相邻的两顶点的关联边的颜色构成的集合不同.对一个图G进行邻强边染色所需要的最少的颜色数称为是G的邻强边色数.本文研究了单圈图的邻强边染色.
|
| 关 键 词： | 单圈图 边染色 邻强边染色 |
| 文章编号： | 1001-4373(2005)06-0138-03 |
| 收稿时间： | 2005-03-10 |
| 修稿时间： | 2005年3月10日 |
On the Adjacent Strong Edge Coloring of Monocycle Graph |
| |
| Zhao Xinmei,Chen Xiang''''en.On the Adjacent Strong Edge Coloring of Monocycle Graph[J].Journal of Lanzhou Railway University,2005,24(6):138-140. |
| |
| Authors: | Zhao Xinmei Chen Xiang'en |
| |
| Institution: | School of Mathematics and Information Science, Northwest Normal University,Lanzhou 730070, China |
| |
| Abstract: | Let G be a simple connected graph with order not less than 3, a k-proper edge coloring of G is called adjacent-strong if for arbitrary two adjacent vertices which are incident to different sets of colored edges. The minimum number required for an adjacent-strong edge coloring of G is called the adjacent strong edge chromatic number. The adjacent strong edge chromatic numbers of monocycle graphs are obtained in this paper. |
| |
| Keywords: | monocycle graph edge coloring adjacent-strong edge coloring |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
