1.
Adjacent Strong Edge Chromatic Number and Adjacent Vertex Distinguishing Total Chromatic Number of Two Classes of Operator Graphs;
两类运算图的邻强边色数与邻点可区别全色数
2.
ON THE ADJACENT STRONG EDGE CHROMATIC NUMBER OF K(r,2);
图K( r,2 )的邻强边色数(英文)
3.
ON THE EQUITABLE ADJACENT STRONG EDGE CHROMATICS NUMBER OF P_2×C_n;
图P_2×C_n 的均匀邻强边色数(英文)
4.
ADJACENT STRONG EDGE COLORING OF MYCIELSKI GRAPH OF WHEEL GRAPH;
轮图的广义Mycielski图的邻强边色数
5.
Two Upper Bound of the Adjacent Strong Edge Coloring and the Adjacent Vertex Distinguishing Total Coloring of General Mycielski-Graphs
广义Mycielski图的邻强边色数和邻点可区别全色数的两个上界
6.
On the Adjacent Strong Edge Coloring and 2-strong Edge Coloring of Some Graphs;
若干图类的邻强边染色与2-强边染色问题研究
7.
The Adjacent-Vertex Distinguishing Edge Coloring and the Fractional Coloring of Graphs;
图的邻点可区别的边染色和分数染色
8.
On the Adjacent Strong Edge Chromatica Number of some Special Complete r-partite Graphs;
一类特殊完全r-部图的邻强边染色
9.
Adjacent Strong Edge Chromatic Number of Cn·Cm,Cn·Fm,Cn·Wm Graphs;
关于图Cn·Cm,Cn·Fm,Cn·Wm的邻强边着色
10.
ON THE ADJACENT STRONG EDGE COLORING OF OUTER PLANAR GRAPHS WITH△(G)≤3;
△(G)=3的外平面图的邻强边染色
11.
The Adjacent Vertex-Distinguishing Edge Coloring of C_m·S_n;
C_m·S_n的邻点可区别边染色
12.
Smarandachely Adjacent Vertex Totol of Graph P_m+P_n
图P_m+P_n的Smarandachely邻点全色数
13.
A graph with maximum degree 5 has a strong edge colouring with at most 38 colours.
最大度等于5的图的强边色数至多为38.
14.
On the Vertex-distinguishing Edge Coloring and Adjacent Strong Edge Coloring of Join-graph and Double Graph of Some Graphs;
若干联图及倍图的（邻）点可区别边染色
15.
On the Adjacent-vertex Distinguishing Edge Coloring of C_(5m)×C_(5n);
C_(5m)×C_(5n)图的邻点可区别的边染色
16.
ADJACENT VERTEX-DISTINGUISHING EDGES COLORING OF(P_n∨P_m);
P_n∨P_m的邻点可区别边染色
17.
On the Smarandachely-adjacent-vertex edge coloring of some double graphs
若干倍图的Smarandachely邻点边染色
18.
On Smarandachely Adjacent Edge Coloring of a Class of Extended Petersen Graph
一类广义Petersen图的Smarandachely邻点边染色