|
|||||
|
|
| 最大度为6且不含相交4-圈的三类平面图的全染色 | |
| 引用本文： | 谭香,陈宏宇,徐兰. 最大度为6且不含相交4-圈的三类平面图的全染色[J]. 山东大学学报(理学版), 2010, 45(4): 31-35 |
| 作者姓名： | 谭香 陈宏宇 徐兰 |
| 作者单位： | 1. 山东财政学院统计与数理学院,山东,济南,250014;山东大学数学学院,山东,济南,250100 2. 山东财政学院统计与数理学院,山东,济南,250014 3. 新疆昌吉学院数学系,新疆,昌吉,831100 |
| 摘 要： | 设G是一个不含相交4-圈的平面图且Δ(G)≥6,证明了如果G还不含相交3-圈,或不含5-圈,或不含6-圈,则全染色数χ″(G)=Δ(G)+1。 |
| 关 键 词： | 平面图 全染色 圈 |
| 收稿时间： | 2009-07-10 |
Total coloring of three types of planar graphs with maximum degree six and without intersecting 4-cycles |
|
| TAN Xiang,CHEN Hong-yu,XU Lan. Total coloring of three types of planar graphs with maximum degree six and without intersecting 4-cycles[J]. Journal of Shandong University, 2010, 45(4): 31-35 | |
| Authors: | TAN Xiang CHEN Hong-yu XU Lan |
| Affiliation: | 1. School of Statistics and Mathematics, Shandong University of Finance, Jinan 250014, Shandong, China;2. School of Mathematics, Shandong University, Jinan 250100, Shandong, China;3. Department of Mathematics, Changji University, Changji 831100, Xinjiang, China |
| Abstract: | Let G be a planar graph with △(G) ≥6 and without intersecting 4-cycles. It is proved that the total chromatic number x″(G) =△(G) +1 if G without intersecting 3-cycles, or without 5-cycles, or without 6-cycles. |
| Keywords: | planar graph total coloring cycle |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 | |
| 点击此处可从《山东大学学报(理学版)》下载全文 | |