| Series-Parallel图的边列表染色 |
| |
| 引用本文： | 李涛,王骁力. Series-Parallel图的边列表染色[J]. 云梦学刊, 1999, 0(4) |
| |
| 作者姓名： | 李涛 王骁力 |
| |
| 作者单位： | 南阳师专数学系!河南南阳473061 |
| |
| 摘 要： | 图 Ｇ不含Ｋ_(４)的剖分图为子图，则称 Ｇ为 Ｓｅｒｉｅｓ－ Ｐａｒａｌｌｅｌ图。图 Ｇ的边列表色数（边选择数）是满足以下条件的最小非负整数ｋ，并记为Ｓ_(ｅ)~(Ｌ)（Ｇ）：对Ｇ的每条边ｅ任配一个由ｋ种颜色组成的色集（色表）Ｌ（ｅ）．Ｇ的每条边ｅ均可着从表Ｌ（ｅ）中选择出的一种颜色，使着色正常。本文通过刻化２－连通Ｓｅｒｉｅｓ－Ｐａｒａｌｌｅｌ图的性质，对△（Ｇ）≠３时，证明了边列表染色猜想：Ｘ_(ｅ)~(Ｌ)（Ｇ）＝Ｘ_(ｅ)（Ｇ）。
|
| 关 键 词： | 平面图 边染色 LCC |
ON THE EDGE LIST COLORING OF SERIES-PARALLEL GRAPHS |
| |
| Li Tao,Wan Xiaoli. ON THE EDGE LIST COLORING OF SERIES-PARALLEL GRAPHS[J]. Journal of Yunmeng, 1999, 0(4) |
| |
| Authors: | Li Tao Wan Xiaoli |
| |
| Affiliation: | Department of Math. Nanyang Teachers' College. Henan Nanyang 473061 |
| |
| Abstract: | Graph G is a Series -Parallel graph, if G does not contain a subgraph which is homeomorphic to the complete 4 - graph. The edge list chromatic number of G. denoted by X_(e)~(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 list no matter what the lists are. In this paper, it is shown that the "List Coloring conjecture" be true for Series -- Parallel graph with maximum degree is not 3, ie. X_(e)~(L)(G) = X_(e)(G). |
| |
| Keywords: | Planar graphs Edge Coloring Lcc |
| 本文献已被 CNKI 等数据库收录！ |
