摘要: 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[J]. 数学季刊, 1996, 11(3): 19-23.
Wang Weifan. The Complete Chromatic Number of Maximal Outerplane Graphs[J]. Chinese Quarterly Journal of Mathematics, 1996, 11(3): 19-23.