Shandong Science ›› 2011, Vol. 24 ›› Issue (6): 12-14.doi: 10.3976/j.issn.1002-4026.2011.06.004

Previous Articles     Next Articles

[r,s,t]-T-total coloring of a graph

 YANG Lin, SUN Lei   

  1. School of Mathematics, Shandong Normal University, Jinan 250014, China
  • Received:2011-05-11 Online:2011-12-20 Published:2011-12-20

Abstract:

This paper applies the restriction conditions of [r,s,t]-coloring to spanning trees, and therefore presents a new total coloring issue. Its general upper bound is also proposed.

Key words: [r,s,t]-T-total coloring, spanning trees, maximum degree

CLC Number: 

  • O157.5