journal6 ›› 2012, Vol. 33 ›› Issue (4): 25-30.DOI: 10.3969/j.issn.1007-2985.2012.04.006
• Mathematics • Previous Articles Next Articles
Online:
Published:
Abstract: List strong edge coloring is defined.It is proved that if G is a graph with d(x)+d(y)≤5,then Sχ′l(G)≤6.
Key words: coloring, strong edge coloring, strong edge chromatic number, list strong edge coloring, strong edge choice number
HUANG Hui-Yun. List Strong Edge Coloring of Some Graphs[J]. journal6, 2012, 33(4): 25-30.
Add to citation manager EndNote|Ris|BibTeX
URL: https://zkxb.jsu.edu.cn/EN/10.3969/j.issn.1007-2985.2012.04.006
https://zkxb.jsu.edu.cn/EN/Y2012/V33/I4/25
