Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 316501, 6 pages
http://dx.doi.org/10.1155/2013/316501
Research Article

Strong List Edge Coloring of Subcubic Graphs

1School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou 221116, China
2College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310023, China
3Department of Mathematics, West Virginia University, Morgantown, WV 26506–6310, USA

Received 9 February 2013; Accepted 31 March 2013

Academic Editor: Carlo Cattani

Copyright © 2013 Hongping Ma et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

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.