【摘 要】
:
The total chromatic number χt(G) of a graph G(V,E) is the minimum number of total independent partition sets of V E, satisfying that any two sets have no commo
【机 构】
:
InstituteofAppliedMathematicsAcademyofMathematicsandSystemsScienceChineseAcademyofSciencesGraduateSc
【基金项目】
:
the National Natural Science Foundation of China (No.10771091)