| 不含相交三角形和4圈的平面图的无圈边染色 |
| |
| 引用本文： | 段娟娟,丁伟,周菲.不含相交三角形和4圈的平面图的无圈边染色[J].苏州科技学院学报(自然科学版),2012,29(2):18-22. |
| |
| 作者姓名： | 段娟娟 丁伟 周菲 |
| |
| 作者单位： | 中国矿业大学理学院,江苏徐州,221008 |
| |
| 基金项目： | 国家自然科学基金资助项目，中央高校基本科研业务费专项基金资助项目 |
| |
| 摘 要： | 如果图G的正常边染色不包含2-色圈,则称它是图G的一个无圈边染色。图G的无圈边色数表示图G的无圈边染色所需的最小颜色数。利用差值转移方法并结合平面图的结构性质,证明了不含相交三角形和4圈的平面图的无圈边色数不超过△(G)+6。
|
| 关 键 词： | 无圈边染色 平面图 相交三角形 差值转移法 |
Acyclic edge coloring of planar graphs without intersecting triangles and cycles of length four |
| |
| DUAN Juanjuan,DING Wei,ZHOU Fei.Acyclic edge coloring of planar graphs without intersecting triangles and cycles of length four[J].Journal of University of Science and Technology of Suzhou,2012,29(2):18-22. |
| |
| Authors: | DUAN Juanjuan DING Wei ZHOU Fei |
| |
| Institution: | (College of Sciences,China University of Mining and Technology,Xuzhou 221008,China) |
| |
| Abstract: | If a proper edge coloring of G contains no bichromatic cycles,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 discharging methods and taking into account the properties of planar graphs,we have proved that if G is a planar graph without intersecting triangles and cycles of length four,its acyclic chromatic number is less than △(G)+6. |
| |
| Keywords: | acyelie edge coloring planar graph intersecting triangle discharging methods |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
