共 50 条
On strong list edge coloring of subcubic graphs
被引:7
|作者:
Zhu, Hong
[1
]
Miao, Zhengke
[1
]
机构:
[1] Jiangsu Normal Univ, Sch Math & Stat, Xuzhou 221116, Peoples R China
基金:
中国国家自然科学基金;
关键词:
Subcubic graphs;
Strong edge coloring;
Maximum average degree;
Strong list edge coloring;
STRONG CHROMATIC INDEX;
D O I:
10.1016/j.disc.2014.06.004
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
In this paper, we give some new results on strong list edge coloring of subcubic graphs. We prove that every subcubic graph with maximum average degree less than 5/2, 8/3 and 14/5 can be strongly list edge colored with seven, eight and nine colors respectively. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:6 / 13
页数:8
相关论文