| The Chromatic Uniqueness of Bipartite Graphs K （ m, n ） - A with ｜ A ｜ = 2 |
| |
| 引用本文： | 邹辉文,朱忠华.The Chromatic Uniqueness of Bipartite Graphs K （ m, n ） - A with ｜ A ｜ = 2[J].东华大学学报(英文版),2006,23(3):47-51. |
| |
| 作者姓名： | 邹辉文 朱忠华 |
| |
| 作者单位： | [1]School of Management, Fuzhou University, Fuzhou 350002 [2]School of Mathematics and Information Science, East China Institute of Technology, Fuzhou 344000 [3]College of Sciences, Donghua University, Shanghai 201620 |
| |
| 摘 要： | The chromatically uniqueness of bipartite graphs K （m, n） - A（]A] = 2） was studied. With comparing the numbers of partitions into r color classes of two chromatically equivalent graphs, one general numerical condition guaranteeing that K（ m, n） - A （ I A ] = 2） is chromatically unique were obtained. This covers and improves the former correlative results.
|
| 关 键 词： | 完全二部图 套色 单值性 标准图 |
| 收稿时间： | 2006-02-20 |
The Chromatic Uniqueness of Bipartite Graphs K ( m, n ) - A with |A| = 2 |
| |
| ZOU Hui-wen,ZHU Zhong-hua.The Chromatic Uniqueness of Bipartite Graphs K ( m, n ) - A with |A| = 2[J].Journal of Donghua University,2006,23(3):47-51. |
| |
| Authors: | ZOU Hui-wen ZHU Zhong-hua |
| |
| Abstract: | The chromatically uniqueness of bipartite graphs K(m, n)- A(|A|=2) was studied. With comparing the numbers of partitions into r color classes of two chromatically equivalent graphs, one general numerical condition guaranteeing that K(m, n)-A(|A|=2) is chromatically unique were obtained. This covers and improves the former correlative results. |
| |
| Keywords: | complete bipartite graph chromatically unique graph chromatically normal graphs partition into color classes |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
