| 图的条件着色的两个上界 |
| |
| 引用本文： | 林越,王哲河.图的条件着色的两个上界[J].琼州学院学报,2010,17(2):8-9,13. |
| |
| 作者姓名： | 林越 王哲河 |
| |
| 作者单位： | 1. 琼州学院理工学院,海南,三亚,572022
2. 琼州学院教务处,海南,三亚,572022 |
| |
| 摘 要： | 通过构造一个可行算法——条件图算法,给出了一般图的条件边集合,并由此得到条件图,对条件图应用正常着色已有性质,证明了两个条件着色色数上界表达式.
|
| 关 键 词： | 条件着色 条件图算法 条件图 Moore图 |
Two New Upper Bounds of Conditional Coloring in Graphs |
| |
| LIN Yue,WANG Zhe-he.Two New Upper Bounds of Conditional Coloring in Graphs[J].Journal of Qiongzhou University,2010,17(2):8-9,13. |
| |
| Authors: | LIN Yue WANG Zhe-he |
| |
| Institution: | LIN Yue1,WANG Zhe-he2 (1.College of Science , Engineering,Qiongzhou University,Sanya Hainan 572022,China,2.Dean\'s Office,China) |
| |
| Abstract: | Finding a conditional graph of simple graphs through a feasible algorithm,discuss the relationship between the chromatic number of conditional graph and the chromatic number of original graph,and then get two upper bounds of conditional coloring. |
| |
| Keywords: | conditional coloring graph of condition algorithm conditional graph moore graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
