Document Type


Publication Date



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.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.