| 不含相交三角形平面图无圈边染色 |
| |
| 引用本文： | 张埂,焦姣.不含相交三角形平面图无圈边染色[J].内江师范学院学报,2012,27(2):17-21. |
| |
| 作者姓名： | 张埂 焦姣 |
| |
| 作者单位： | 1. 四川文理学院学报编辑部,四川达州,635000
2. 中国矿业大学理学院,江苏徐州,221008 |
| |
| 基金项目： | 中央高校基本科研专项基金，四川文理学院科研项目 |
| |
| 摘 要： | 如果图G的正常边染色不包含2-色圈,则称它是图G的一个无圈边染色.图G的无圈边色数表示图G的无圈边染色所需的最小颜色数.为研究平面图的无圈边色数的上界,利用差值转移方法并结合平面图的结构性质,证明了不含相交三角形的平面图的无圈边色数不超过Δ（G）＋7.
|
| 关 键 词： | 无圈边染色 平面图 相交三角形 |
Acyclic Edge Coloring of Planar Graphs Without Intersecting Triangles |
| |
| ZHANG Geng,JIAO Jiao.Acyclic Edge Coloring of Planar Graphs Without Intersecting Triangles[J].Journal of Neijiang Teachers College,2012,27(2):17-21. |
| |
| Authors: | ZHANG Geng JIAO Jiao |
| |
| Institution: | 1.Journal Editorial Department,Sichuan University of Arts and Science,Dazhou,Sichuan 635000,China; 2.College of Science,China University of Mining and Technology,Xuzhou,Jiangsu 221008,China) |
| |
| Abstract: | Given that a proper edge coloring of G contains no bichromatic cycles inG,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.In order to study the upper bound of acyclic chromatic number of planar graphs,by using discharging methods and some properties of planar graphs,the paper has proved that if G is a planar graph without intersecting triangles,then its acyclic chromatic number will be not more than G. |
| |
| Keywords: | acyclic edge coloring planar graph intersecting triangles |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
