Article ID Journal Published Year Pages File Type
4647099 Discrete Mathematics 2014 8 Pages PDF
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 52, 83 and 145 can be strongly list edge colored with seven, eight and nine colors respectively.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On strong list edge coloring of subcubic graphs
Authors
, ,