Chinese Quarterly Journal of Mathematics ›› 1996, Vol. 11 ›› Issue (3): 19-23.

Previous Articles     Next Articles

The Complete Chromatic Number of Maximal Outerplane Graphs

  

  1. Department   of   Mathematics,Nanjing    University,210093
  • Received:1993-10-23 Online:1996-09-30 Published:2024-12-25
  • Supported by:
     Project supported by the Vatural SCience Foundation of LNEC.

Abstract: 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.

Key words: maximal outerplane graph, complete chromatic number, maximum degree of vertices ,

CLC Number: