| 平面图3-可着色的3个充分条件 |
| |
| 引用本文： | 彩春丽,谢德政.平面图3-可着色的3个充分条件[J].河南师范大学学报(自然科学版),2011,39(6):4-6,28. |
| |
| 作者姓名： | 彩春丽 谢德政 |
| |
| 作者单位： | 重庆大学数学与统计学院,重庆,401331 |
| |
| 基金项目： | 重庆市科委自然科学基金 |
| |
| 摘 要： | 平面图3-可着色是指可用3种颜色对该图的顶点进行着色,使得相邻的顶点着不同的颜色.研究了平面图在长度不大于6的圈或长度不大于7的圈之间满足一定条件下是3-可着色的.
|
| 关 键 词： | 平面图 圈 距离 3-可着色 |
Three Sufficient Conditions for Planar Graphs to be 3-Colorable |
| |
| CAI Chun-li,XIE De-zheng.Three Sufficient Conditions for Planar Graphs to be 3-Colorable[J].Journal of Henan Normal University(Natural Science),2011,39(6):4-6,28. |
| |
| Authors: | CAI Chun-li XIE De-zheng |
| |
| Institution: | (College of Mathematics and Statistics,Chongqing University,Chongqing 401331,China) |
| |
| Abstract: | A planar graph is 3-colorable if its vertices can be colored with three colors,no two adjacent vertices coloring the same color.It has studied that planar graphs which can be 3-colorable provided that the cycles of length at most 6 or 7 which satisfy some conditions. |
| |
| Keywords: | planar graphs cycles distance 3-colorable |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
