Title of article :
The total chromatic number of graphs of even order and high degree Original Research Article
Author/Authors :
For a given graph G، نويسنده , , G? is a forest، نويسنده , , and ?(G)+?(G)?32(|V(G)|?1) then ?T(G)=?(G)+1. We also show that for graphs G of even order and ?(G)+?(G)?32|V(G)|?52 we have that ?T(G)??(G)+2.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Abstract :
Dezheng Xie, Wanlian Yang
Keywords :
Total colouring , Total chromatic number
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
