| 最大度为6且不含5-圈和相邻4一圈的平面图是7-全可染的 |
| |
| 引用本文： | 张静雯. 最大度为6且不含5-圈和相邻4一圈的平面图是7-全可染的[J]. 浙江师范大学学报(自然科学版), 2011, 34(3) |
| |
| 作者姓名： | 张静雯 |
| |
| 作者单位： | 浙江师范大学 数理与信息工程学院,浙江 金华,321004 |
| |
| 基金项目： | 浙江省自然科学基金资助项目 |
| |
| 摘 要： | 运用Discharging方法,证明了最大度为6且不含5-圈和相邻4-圈的简单平面图是7-全可染的.所得结果改进了现有文献的相关结果.
|
| 关 键 词： | 平面图 全染色 最大度 5-圈 相邻4-圈 |
On the 7-total-colorability of plane graphswith maximum degree 6 without 5-cycles and adjacent 4-cycles |
| |
| ZHANG Jingwen. On the 7-total-colorability of plane graphswith maximum degree 6 without 5-cycles and adjacent 4-cycles[J]. Journal of Zhejiang Normal University Natural Sciences, 2011, 34(3) |
| |
| Authors: | ZHANG Jingwen |
| |
| Affiliation: | ZHANG Jingwen(College of Mathematics,Physics and Information Engineering,Zhejiang Normal University,Jinhua Zhejiang 321004,China) |
| |
| Abstract: | By using the discharging method,it was proved that plane graphs with maximum degree 6 and without 5-cycles and adjacent 4-cycles were 7-totally-colorable.This improved the known results in literatures. |
| |
| Keywords: | plane graph total coloring maximum degree 5-cycles adjacent 4-cycles |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
