Title of article
On strong list edge coloring of subcubic graphs
Author/Authors
Zhu، نويسنده , , Hong Yan Miao، نويسنده , , Zhengke، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
8
From page
6
To page
13
Abstract
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.
Keywords
subcubic graphs , Strong edge coloring , Strong list edge coloring , maximum average degree
Journal title
Discrete Mathematics
Serial Year
2014
Journal title
Discrete Mathematics
Record number
1600741
Link To Document