J4 ›› 2012, Vol. 47 ›› Issue (6): 67-70.
• Articles • Previous Articles Next Articles
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
WANG Yan-li, MIAO Lian-ying. The set edge chromatic number of a graph[J].J4, 2012, 47(6): 67-70.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://lxbwk.njournal.sdu.edu.cn/EN/
http://lxbwk.njournal.sdu.edu.cn/EN/Y2012/V47/I6/67
Cited