| 基于最大平均度的图的无圈边染色 |
| |
| 引用本文： | 张埂,丁伟,扈丁文.基于最大平均度的图的无圈边染色[J].信阳师范学院学报(自然科学版),2012(2):156-159. |
| |
| 作者姓名： | 张埂 丁伟 扈丁文 |
| |
| 作者单位： | 四川文理学院学报编辑部;中国矿业大学理学院;达县中学 |
| |
| 基金项目： | 中央高校基本科研业务费专项基金资助(LK0103);四川文理学院2011年院级科研项目(2011Z008Y) |
| |
| 摘 要： | 为研究图的无圈边色数与图的最大平均度之间的关系,利用差值转移方法和最小反例图的一些结构性质,证明了最大平均度不小于7/2的简单图G,如果其最大度不小于6,则其无圈边色数不超过Δ(G)+2.
|
| 关 键 词： | 无圈边染色 无圈边色数 差值转移法 最大平均度 |
Acyclic Edge Coloring of Graphs Based on Maximum Average Degree |
| |
| ZHANG Geng,DING Wei,HU Ding-wen.Acyclic Edge Coloring of Graphs Based on Maximum Average Degree[J].Journal of Xinyang Teachers College(Natural Science Edition),2012(2):156-159. |
| |
| Authors: | ZHANG Geng DING Wei HU Ding-wen |
| |
| Institution: | 1.Editorial Department of Journal,Sichuan University of Arts and Science,Dazhou 635000,China; 2.College of Science,China University of Mining and Technology,Xuzhou 221008,China; 3.Daxian High School,Dazhou 635000,China) |
| |
| Abstract: | In order to uncover the relations between the acyclic chromatic number and the maximum average degree of simple graph,by using discharging method and some properties of minimal graph,it was proved that for any simple graphs G with maximum average degree at least 7/2,if its maximum degree is no less than 6,then it’s acyclic chromatic number is no more than Δ(G)+2. |
| |
| Keywords: | acyclic edge coloring acyclic chromatic number discharging method maximum average degree |
| 本文献已被 CNKI 等数据库收录！ |
|
