| The Complete Chromatic Number of Maximal Outerplane Graphs |
| |
| 作者姓名： | 王维凡 |
| |
| 作者单位： | Department of Mathematics，Nanjing University，210093 |
| |
| 基金项目： | Project supported by the Vatural SCience Foundation of LNEC． |
| |
| 摘 要： | Let G be a maximal outerplane graph and X0(G) the complete chromatic number of G. This paper determines exactly X0(G) for △(G)≠5 and proves 6≤X0.(G)≤7 for △(G) = 5, where △(G) is the maximum degree of vertices of G.
|
| 关 键 词： | 极大外平面图 全色数 最大顶点度 |
The Complete Chromatic Number of Maximal Outerplane Graphs |
| |
| Wang Weifan.The Complete Chromatic Number of Maximal Outerplane Graphs[J].Chinese Quarterly Journal of Mathematics,1996,11(3):19-23. |
| |
| Authors: | Wang Weifan |
| |
| Abstract: | |
| |
| Keywords: | maximal outerplane graph complete chromatic number maximum degree of vertices |
| 本文献已被 CNKI 维普 等数据库收录！ |
