| 一些平面图的无圈边染色 |
| |
| 引用本文： | 孙向勇,吴建良.一些平面图的无圈边染色[J].山东大学学报(理学版),2008,43(9):63-67. |
| |
| 作者姓名： | 孙向勇 吴建良 |
| |
| 作者单位： | 1. 山东经济学院统计与数学学院,山东,济南,250014
2. 山东大学数学学院,山东,济南,250100 |
| |
| 摘 要： | 主要研究了平面图的无圈边染色问题。证明了对平面图G,如果G不包含3,5圈,且G中任意两个4-圈都不共边,则无圈边染色猜想成立;并且,如果G不含3-圈,且任意两个4-圈不共点,则G的无圈边染色数不大于Δ(G)+3。
|
| 关 键 词： | 平面图 圈 无圈边染色 无圈边染色数 |
Acyclic edge coloring of some planar graphs |
| |
| SUN Xiang-yong,WU Jian-liang.Acyclic edge coloring of some planar graphs[J].Journal of Shandong University,2008,43(9):63-67. |
| |
| Authors: | SUN Xiang-yong WU Jian-liang |
| |
| Institution: | 1. School of Statistics and Mathematics, Shandong Economic University, Jinan 250014, Shandong, China;2. School of Mathematics and System Science, Shandong University, Jinan 250100, Shandong, China |
| |
| Abstract: | If a planar graph G contains no i-cycles, i=3,5, and any two 4-cycles have no common edge, then the acyclic edge coloring conjecture holds. And if a planar graph G contains no 3-cycles and any two 4-cycles have no common vertex, then acyclic edge chromatic number of G is at most Δ(G)+3. |
| |
| Keywords: | planar graph cycle acyclic edge coloring acyclic edge coloring number |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《山东大学学报(理学版)》下载免费的PDF全文 |
|
