J4 ›› 2012, Vol. 47 ›› Issue (6): 67-70.
• 论文 • 上一篇 下一篇
王艳丽,苗连英
收稿日期:
出版日期:
发布日期:
作者简介:
基金资助:
中央高校基本科研业务费专项基金 (2010LKSX06)
WANG Yan-li, MIAO Lian-ying
Received:
Online:
Published:
摘要：
给出了集合边色数的定义。运用结构图论的方法,给出了集合边色数的下界以及图与其顶点删除子图、边删除子图的集合边色数的关系。
关键词: 集合边色数; 邻色集; 集合边染色; 度
Abstract:
The definition of set edge chromatic number is given. By the use of the method of structure graph theory, the lower bounds of the set edge chromatic numbers of graphs, the relationships among the set edge chromatic numbers of a graph, and its vertexdeleted subgraphs and its edge-deleted subgraphs are given.
Key words: set edge chromatic number; neighborhood color set; set edge coloring; degrees
王艳丽,苗连英. 图的集合边色数[J]. J4, 2012, 47(6): 67-70.
WANG Yan-li, MIAO Lian-ying. The set edge chromatic number of a graph[J]. J4, 2012, 47(6): 67-70.
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: http://lxbwk.njournal.sdu.edu.cn/CN/
http://lxbwk.njournal.sdu.edu.cn/CN/Y2012/V47/I6/67
Cited
