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 Published:2011-12-20 Online: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

Open Access This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0), which permits third parties to freely share (i.e., copy and redistribute the material in any medium or format) and adapt (i.e., remix, transform, or build upon the material) the articles published in this journal, provided that appropriate credit is given, a link to the license is provided, and any changes made are indicated. The material may not be used for commercial purposes. For details of the CC BY-NC 4.0 license, please visit: https://creativecommons.org/licenses/by-nc/4.0