| 不含4圈的平面图的无圈边染色 |
| |
| 引用本文： | 丁伟.不含4圈的平面图的无圈边染色[J].山东大学学报(理学版),2012,47(6):76-79. |
| |
| 作者姓名： | 丁伟 |
| |
| 作者单位： | 中国矿业大学理学院,江苏徐州,221008 |
| |
| 基金项目： | 中央高校基本科研业务费专项基金(2010LKSX06);国家自然科学基金资助项目(NSFC11001265) |
| |
| 摘 要： | 如果图G的正常边染色不包含2-色圈,则称它是图G的一个无圈边染色。图G的无圈边色数表示图G的无圈边染色所需的最小颜色数。利用已有的关于平面图的结构性质,证明了不含4圈的2-连通平面图的无圈边色数不超过Δ(G)+11。
|
| 关 键 词： | 无圈边染色 平面图 围长 |
Acyclic edge coloring of planar graphs without 4-Cycles |
| |
| DING Wei.Acyclic edge coloring of planar graphs without 4-Cycles[J].Journal of Shandong University,2012,47(6):76-79. |
| |
| Authors: | DING Wei |
| |
| Institution: | DING Wei(College of Science,China University of Mining and Technology,Xuzhou 221008,Jiangsu,China) |
| |
| Abstract: | If a proper edge coloring of G contains no bichromatic cycles in G,then it is an acyclic edge coloring of G.The acyclic chromatic number of G is the minimum number of colors among all the acyclic edge colorings of G.By using the properties of planar graphs that have been proposed,it is proved that if G is a 2-connected planar graph without 4-cycles,then its acyclic chromatic number is no more than Δ(G)+11. |
| |
| Keywords: | acyclic edge coloring planar graph girth |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
