外平面图的边列表染色

如果一个平面图的顶点均位于一个面的边界上，则称此图为外平面图。图的边列表色数（边选择数）是满足下列条件的最小非负整数k，并记为X'L（G）：对G的每一条边e任意配一由k种颜色组成的色集（色表）L（e），G的每条边可以着从L（e）中选择出的一种颜色，使着色正常。本文对Δ（G）≠3的外平面图证明了列表染色猜想：X'L（G）＝X’（G）。

On the edge list coloring of outerplanar graphs

An outerplanar graph G is a plane graph with its all venices lying on a face of G. The the list chromatic number of a graph G, denoted by X'L(G), is the minimum number k such that if we give lists of k colors to each edge of G, there is a proper edge coloring of G where each edge receives a color from its own list no matter what the lists are. In mis paper, it is shown that the "List Coloring Conjucture" be true for outerplanar graphs with the maximum degree is not 3, ie.X'L(G) = X'(G).