| 最大度是6不含相邻k-圈的可平面图的边染色 |
| |
| 引用本文： | 倪伟平.最大度是6不含相邻k-圈的可平面图的边染色[J].华东师范大学学报(自然科学版),2010,2010(5):20-26. |
| |
| 作者姓名： | 倪伟平 |
| |
| 作者单位： | 枣庄学院数学与信息科学系,山东枣庄,277160 |
| |
| 摘 要： | 运用Discharge方法和临界图性质证明了,最大度是6且任意两个长度至多是6的k-圈不相邻的可平面图是第一类图.
|
| 关 键 词： | 平面图 边染色 最大度 圈 平面图 边染色 最大度 圈 |
| 收稿时间： | 2009-8-1 |
| 修稿时间： | 2009-12-1 |
Edge coloring of planar graphs for maximum degree six without adjacent k-cycles |
| |
| NI Wei-ping.Edge coloring of planar graphs for maximum degree six without adjacent k-cycles[J].Journal of East China Normal University(Natural Science),2010,2010(5):20-26. |
| |
| Authors: | NI Wei-ping |
| |
| Institution: | Department of Mathematics and Information Science, Zaozhuang University, Zaozhuang Shandong 277160, China |
| |
| Abstract: | By applying discharging method and using the properties of critical graphs, we proved that every simple planar graph G with Delta =6 is of class 1, if any two k-cycles of length at most 6 are not adjacent. |
| |
| Keywords: | planar graph edge coloring maximum degree cycle |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《华东师范大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《华东师范大学学报(自然科学版)》下载免费的PDF全文 |
