一类边列表3-染色图

Some 3 - edge - Choosable Graphs

如果 S是图G的割边集,△(G(S))是边导出子图G(S)的最大度,G_1,G_2是 G\S的连通分支,且G_1,G_2分别是边列表k_1,k_2-染色的,则图G的边列表染色指标不超过max{k_1,k_2}+2△(G(S)),由此给出一类边列表3-染色图,并且证明完全图k_4是边列表3-染色的。

Let S be a cut edge - set of a graph G, △ G( S ) the maximal degree of the subgraph G( S ) induced by S, G1 , G2 the connected components of the graph G \ S . If G1, G2 are κ1, κ2 - edge - choosable respectively, then the list-chromatic number is no more than max{κ1, κ2 } + 2△( G( S)) . The article gives out some 3 - edge - choosable graphs, and shows that the complete graph κ4 is 3 - edge - choosable.