Strong List Edge Coloring of Subcubic Graphs
Hongping Ma, Zhengke Miao, Hong Tu Zhu, Jianhua Zhang, Rong Luo · Mathematical Problems in Engineering · 2013
We study strong list edge coloring of subcubic graphs, and we prove that every subcubic graph with maximum average degree less than 15/7, 27/11, 13/5, and 36/13 can be strongly list edge colored with six, seven, eight, and nine colors, respectively.