| 不含4-和5-圈的平面图的均匀染色 |
| |
| 引用本文： | 王维凡,桂浩. 不含4-和5-圈的平面图的均匀染色[J]. 浙江师范大学学报(自然科学版), 2014, 0(1): 1-6 |
| |
| 作者姓名： | 王维凡 桂浩 |
| |
| 作者单位： | 浙江师范大学数理与信息工程学院,浙江金华321004 |
| |
| 基金项目： | 国家自然科学基金资助项目（11371328） |
| |
| 摘 要： | 一个图G是均匀k-可染的,如果G有一个k-染色(V1,V2,…,Vk),使得对任何i,j∈{1,2,…,k}有||Vi|-|Vj||≤1.应用细致的结构分析和经典的discharging方法证明了:最大度5≤Δ≤6且没有4-,5-圈的平面图是均匀Δ-可染的.
|
| 关 键 词： | 均匀染色 平面图 圈 最大度 |
Equitable coloring of planar graphs without 4-and 5-cycles |
| |
| WANG Weifan,GUI Hao. Equitable coloring of planar graphs without 4-and 5-cycles[J]. Journal of Zhejiang Normal University Natural Sciences, 2014, 0(1): 1-6 |
| |
| Authors: | WANG Weifan GUI Hao |
| |
| Affiliation: | (College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua Zhefiang 321004, China l |
| |
| Abstract: | A graph G was denoted equitably k-colorable if G admitted a proper vertex k-coloring such that the sizes of any two color classes differed by at most 1. It was showed that every planar graph G with 5 ≤△ ≤6 and without 4- and 5-cycles was equitably k-colorable for any k ≥ △. The present proof was based on structural analysis and discharging technique. |
| |
| Keywords: | equitably coloring planar graph cycle maximum degree |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
