围长不小于11且最大度为3的平面图的无圈列表边染色

Acyclic list edge coloring of planar graphs with girth≥11 and maximum degree 3

若图G为最大度为3且围长不小于11的平面图,证明了它的无圈边色数a'list(G)=3。

Let G be a planar graph with maximum degree 3.It is proved that the acyclic list edge coloring of G is 3 if its girth is at least 11.