| 关于图的4-色数 |
| |
| 引用本文： | 林可容,张忠辅.关于图的4-色数[J].福州大学学报(自然科学版),1991(4):18-22. |
| |
| 作者姓名： | 林可容 张忠辅 |
| |
| 作者单位： | 福州大学数学系
(林可容)，兰州铁道学院(张忠辅) |
| |
| 摘 要： | 本文研究了图的４色数的界，得到了完全图．完全ｍ－部图、轮、圈和树的４－色数及图与补图４－色数间的关系，证明了图Ｇ与补图Ｇ的４－色数之和介于ｐ＋１与２ｐ之间。
|
| 关 键 词： | 图 4色数 界 补图 |
On 4-Chromatic Number of Graphs |
| |
| Lin Kerong Zhang Zhongfu.On 4-Chromatic Number of Graphs[J].Journal of Fuzhou University(Natural Science Edition),1991(4):18-22. |
| |
| Authors: | Lin Kerong Zhang Zhongfu |
| |
| Institution: | Lin Kerong Zhang Zhongfu (Department of Mathematics) (Lanzhou Railway Institue) |
| |
| Abstract: | In this paper, the bounds of the 4-chromatic numbers or graph are studied. The 4-chromatic numbers of complete graph, the complete m-partite graph, the wheel, the cycle and tree, and the rclation between the 4-chromatic of graph and the 4-chromatic numbcr of complemental graph bave been got. Furthermore, it proves that the sum of the 4-chromatic numbcr of graph and the 4-chromatic number of complemental graph is neither greater than 2p nor amaller than p+1. |
| |
| Keywords: | graphs 4-chromatic number bound complemental graph |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《福州大学学报(自然科学版)》下载免费的PDF全文 |
