On strong list edge coloring of subcubic graphs

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.

Saved in:
Bibliographic Details
Published in:Discrete mathematics 2014-10, Vol.333, p.6-13
Main Authors: Zhu, Hong, Miao, Zhengke
Format: Article
Language:English
Subjects:
Maximum average degree
Strong edge coloring
Strong list edge coloring
Subcubic graphs
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2014.06.004