Document Type

Article

Publication Date

2013

Abstract

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.

Source Citation

Ma, Hongping., Miao, Zhengke., Zhu, Hong., Zhang, Jianhua., & Luo, Rong.(2013). Strong List Edge Coloring Of Subcubic Graphs. Mathematical Problems In Engineering, 2013. http://doi.org/10.1155/2013/316501

Share

COinS