1.
On The Complete Coloring of W_m·K_n;
关于W_m·K_n的边色数和全色数
2.
ON THE EDGE CHROMATIC NUMBER AND EQUITABLE CHROMATIC NUMBER OF S_m ∨ K_(n,n);
S_m ∨ K_(n,n)的边色数和均匀全色数
3.
Smarandachely Adjacent Vertex Totol of Graph P_m+P_n
图P_m+P_n的Smarandachely邻点全色数
4.
On the total coloring number of C_mP_na nd GP_n
C_mP_n和GP_n的全色数
5.
Adjacent Strong Edge Chromatic Number and Adjacent Vertex Distinguishing Total Chromatic Number of Two Classes of Operator Graphs;
两类运算图的邻强边色数与邻点可区别全色数
6.
On the Adjacent Vertex-distinguishing Total Coloring Number of C_4×C_4、C_4×C_5、C_5×C_5;
C_4×C_4、C_4×C_5、C_5×C_5的邻点可区别全色数
7.
A NOTE OF THE ADJACENT VERTEX-DISTINGUISHING TOTAL CHROMATIC NUMBER OF k-CUBE GRAPH;
k-方体图邻点可区别全色数(英文)
8.
The Total Chromatic Number of Halin Graph with an Unique Major Vertex;
具有唯一最大度点的Halin图的全色数
9.
The adjacent-vertex-distinguishing total chromaticnumber of C_mC_n
C_mC_n的邻点可区别全色数
10.
Vertex-distinguishing Total Chromatic Nnumber of S_m×S_n,S_m×F_n and S_m×W_n
S_m×S_n,S_m×F_n和S_m×W_n的点可区别全色数
11.
The First Kind Weak Total Chromatic Number of Graph P_m∨W_n and W_m∨W_n
图P_m∨W_n与W_m∨W_n的第一类弱全色数
12.
On a Number of Adjacent Vertex-distinguishing Edge Total of Double Graphs
图S_m∨F_n,F_m∨F_n与W_m∨F_n的第一类弱全色数
13.
On the Equitable Total Coloring of the Join Graph of Fan and Complete Balanced 2-partite Graph
关于扇和完全等二部图联图的均匀全色数
14.
Two Upper Bound of the Adjacent Strong Edge Coloring and the Adjacent Vertex Distinguishing Total Coloring of General Mycielski-Graphs
广义Mycielski图的邻强边色数和邻点可区别全色数的两个上界
15.
On the Vertex Incidence-adjacent Vertex-distinguishing Total Coloring of D(F_n) and D(W_n)
关于D(F_n)和D(W_n)的点关联邻点可区别全色数
16.
An upper bound on the vertex-distinguishing IE-totalchromatic number of graphs
图的点可区别IE-全色数的一个上界(英文)
17.
The Total Coloring, the Adjacent Vertex-distinguish Total Coloring and the Fractional Coloring of Graphs;
图的全染色、邻点可区别全染色及分数染色
18.
The Total Coloring, the (Adjacent) Vertex-distinguish Total Coloring and the Fractional Coloring of Graphs;
图的全染色、（邻）点可区别全染色及分数染色