| 关于完全三部图K(m,n,r)的色唯一性 |
| |
| 引用本文： | 邹辉文.关于完全三部图K(m,n,r)的色唯一性[J].数学杂志,2003,23(3):307-314. |
| |
| 作者姓名： | 邹辉文 |
| |
| 作者单位： | 同济大学投资研究所,上海,200092;抚州师范专科学校数学与计算机系,抚州,344000 |
| |
| 基金项目： | National Natural Science Fiundation of China (19471053) |
| |
| 摘 要： | 本文研究完全三部图K(m,n,r)的色唯一性问题，通过比较两个色等价图的色划分数的方法，得出两个关于K(m,n,r)为色唯一图的一般形式数值条件，基本上解决了K(m,n,r)为色唯一图的判定问题．
|
| 关 键 词： | 完全三部图 色唯一图 色划分 |
THE CHROMATIC UNIQUENESS OF CERTAIN COMPLETE TRIPARTITE GRAPHS K(m,n,r) |
| |
| ZOU Hui-wen.THE CHROMATIC UNIQUENESS OF CERTAIN COMPLETE TRIPARTITE GRAPHS K(m,n,r)[J].Journal of Mathematics,2003,23(3):307-314. |
| |
| Authors: | ZOU Hui-wen |
| |
| Abstract: | The chromatically uniqueness of complete tripartite graphs K(m, n, r) was studied. With comparing the numbers of partitions into r color classes of two chromatically equivalent graphs, two general numerical conditions guaranteeing that K(m, n, r) is chromatically unique were obtained. The problem of determining which of graphs K(m, n, r) is chromatically unique was fundamentally solved. |
| |
| Keywords: | complete tripartite graph chromatically unique graph partiton into color classes |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
