1.
ON THE VERTEX STRONG TOTAL COLORING OF HALIN GRAPHS WITH Δ(G)≤5;
最大度不大于5的Halin-图的点强全染色(英文)
2.
ADJACENT STRONG VERTEX-DISTINGUISHING TOTAL COLORING OF P_n~k(k≡2(mod 3));
P_n~k(k≡2(mod3))的邻点可区别的强全染色
3.
Adjacent Strong Verte-Distinuishing Total Coloring of D(p_n)
D(p_n)图的邻点强可区别全染色
4.
On Adjacent Strong Vertex-Distinguishing Total Coloring of P_m×C_n
一类P_m×C_n图的邻点强可区别全染色
5.
The Research of Algorithm for Strong Vertex-distinguishing Total Coloring
若干图的点可区别强全染色的算法研究
6.
The Total Coloring, the Adjacent Vertex-distinguish Total Coloring and the Fractional Coloring of Graphs;
图的全染色、邻点可区别全染色及分数染色
7.
The Total Coloring, the (Adjacent) Vertex-distinguish Total Coloring and the Fractional Coloring of Graphs;
图的全染色、（邻）点可区别全染色及分数染色
8.
(Adjacent) Vertex-distinguishing Total Colorings and Fractional Colorings of Graphs;
图的（邻）点可区别全染色和分数染色
9.
The Adjacent Vertex-distinguish Total Coloring and the Coloring Problem That be Submitted to the Total Colors Subgraph;
图的邻点可区别全染色和有全色子图限制的染色问题
10.
On the Adjacent Strong Edge Chromatica Number of some Special Complete r-partite Graphs;
一类特殊完全r-部图的邻强边染色
11.
Study on the Adjacent Vertex Distinguishing Total Coloring of Some Types of Graphs;
若干图类的邻点可区别全染色的研究
12.
On Adjacent Vertex Distinguishing Total Coloring of the Joint Graph Wm∨Pn;
联图W_m∨P_n的邻点可区别全染色
13.
ON THE ADJACENT VERTEX-DISTINGUISHING TOTAL COLORING OF GENERAL θ- GRAPH;
广义θ-图的邻点可区别的全染色(英文)
14.
On adjacent vertex-distinguishing total colorings of graphs P_m*P_n;
关于图P_m*P_n的邻点可区别全染色
15.
ON THE TOTAL COLORING AND ADJACENT VERTEX-DISTINGUISHING TOTAL COLORING OF P_m∨S_m;
P_m∨S_n的邻点可区别全染色
16.
On the adjacent vertex distinguishing total coloring of p_m×K_(n,n)
p_m×K_(n,n)的邻点可区别全染色
17.
Adjacent vertex distinguishing total coloring of path's general Mycielski graphs
路的广义Mycielski图的邻点可区别的全染色
18.
On Adjacent Vertex-distinguishing Total Coloring of P_m∨S_(n,n)
联图P_m∨S_(n,n)的邻点可区别全染色