| 平面图的k-重(2k+2)-染色 |
| |
| 引用本文： | 吴玉蝶,卜月华.平面图的k-重(2k+2)-染色[J].数学研究,2011,44(1):1-15. |
| |
| 作者姓名： | 吴玉蝶 卜月华 |
| |
| 作者单位： | 浙江师范大学数理与信息工程学院,浙江,金华,321004 |
| |
| 基金项目： | supported by the National Natural Science Foundation of China(10971198). |
| |
| 摘 要： | G=(V,E)表示一个顶点集为V,边集为E的有限简单无向图.若存在映射φ:V(G)→Zk(n)(Zk(n)是由{1,2,…,n}的所有k-元子集构成的集合),满足:(A) uv∈E(G),有φ(u)∩φ(u)=θ,则称φ是G的一个k-重n-顶点染色.本文证明了奇围长至少为5k-7(k=4)或5k-9(k=6)的平面图G...
|
| 关 键 词： | k-重染色 平面图 奇围长 |
k-fold(2k+2)-Coloring of Planar Graphs |
| |
| Wu Yudie,Bu Yuehua.k-fold(2k+2)-Coloring of Planar Graphs[J].Journal of Mathematical Study,2011,44(1):1-15. |
| |
| Authors: | Wu Yudie Bu Yuehua |
| |
| Institution: | Wu Yudie Bu Yuehua (College of Mathematics,Physics and Information Engineering,Zhejiang Normal University,Jinhua Zhejiang 321004) |
| |
| Abstract: | Let G = (V, E) be a finite, simple and undirected graph with the set of vertices V, and the set of edges E. A k-fold n-coloring of a graph G is a mapping φ : V(G) → Zk(n) (Zk(n) is the collection of all k-subsets of {1, 2,… , n} ). such that : (A)uv ∈ E(G), there is φ(u) ∩φ(v) = θ, then say G is k-fold n-colorable. We show that every planar graph with odd girth at least 5k - 7(k = 4) or 5k - 9(k = 6) can be k-fold (2k + 2)-colorable. |
| |
| Keywords: | k-fold coloring Planar graph Odd girth |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
