1.
We shall present some of the basic properties of the vertex and edge chromatic numbers.
我们将介绍顶点色数和边色数的一些基本性质。
2.
Smarandachely Adjacent Vertex Totol of Graph P_m+P_n
图P_m+P_n的Smarandachely邻点全色数
3.
Bounds for two multicolor vertex Folkman numbers
两个多色顶点Folkman数的界
4.
The Adjacent-Vertex Distinguishing Edge Coloring and the Fractional Coloring of Graphs;
图的邻点可区别的边染色和分数染色
5.
(Adjacent) Vertex-distinguishing Total Colorings and Fractional Colorings of Graphs;
图的（邻）点可区别全染色和分数染色
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 Strong Edge Chromatic Number and Adjacent Vertex Distinguishing Total Chromatic Number of Two Classes of Operator Graphs;
两类运算图的邻强边色数与邻点可区别全色数
9.
ON VERTEX-DISTINGUISHING EDGE CHROMATIC NUMBER OF C_m∨C_n AND C_m∨S_n;
关于C_m∨C_n和C_m∨S_n的点可区别边色数
10.
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的邻点可区别全色数
11.
Vertex-Distinguishing Edges Coloring of (S_m~*S_n);
图S_m~*S_n的点可区别的边色数
12.
A NOTE OF THE ADJACENT VERTEX-DISTINGUISHING TOTAL CHROMATIC NUMBER OF k-CUBE GRAPH;
k-方体图邻点可区别全色数(英文)
13.
The Total Chromatic Number of Halin Graph with an Unique Major Vertex;
具有唯一最大度点的Halin图的全色数
14.
On the Vertex-distinguishing Edge Chromatic Number of S_m∨W_n
图S_m∨W_n的点可区别边色数
15.
Adjacent vertex-distinguish incidence chromatic number of crown graph
皇冠图G_(n,m)的邻点可区别关联色数
16.
The adjacent-vertex-distinguishing total chromaticnumber of C_mC_n
C_mC_n的邻点可区别全色数
17.
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的点可区别全色数
18.
D(3)-vertex-distinguishable proper edge-chromatic number of C_m·P_n
C_m·P_n的D(3)-点可区别边色数