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.
We shall present some of the basic properties of the vertex and edge chromatic numbers.
我们将介绍顶点色数和边色数的一些基本性质。
4.
Adjacent Strong Edge Chromatic Number and Adjacent Vertex Distinguishing Total Chromatic Number of Two Classes of Operator Graphs;
两类运算图的邻强边色数与邻点可区别全色数
5.
ON VERTEX-DISTINGUISHING EDGE CHROMATIC NUMBER OF C_m∨C_n AND C_m∨S_n;
关于C_m∨C_n和C_m∨S_n的点可区别边色数
6.
ON THE ADJACENT STRONG EDGE CHROMATIC NUMBER OF K(r,2);
图K( r,2 )的邻强边色数(英文)
7.
Vertex-Distinguishing Edges Coloring of (S_m~*S_n);
图S_m~*S_n的点可区别的边色数
8.
ON THE EQUITABLE ADJACENT STRONG EDGE CHROMATICS NUMBER OF P_2×C_n;
图P_2×C_n 的均匀邻强边色数(英文)
9.
ADJACENT STRONG EDGE COLORING OF MYCIELSKI GRAPH OF WHEEL GRAPH;
轮图的广义Mycielski图的邻强边色数
10.
ON THE HAMILTON PROPERTY AND EDGE CHROMATIC NUMBER OF INCIDENCE GRAPH OF PETERSEN GRAPH;
Petersen图的Hamilton性和边色数(英文)
11.
On the Vertex-distinguishing Edge Chromatic Number of S_m∨W_n
图S_m∨W_n的点可区别边色数
12.
D(3)-vertex-distinguishable proper edge-chromatic number of C_m·P_n
C_m·P_n的D(3)-点可区别边色数
13.
Vertex-Distinguishing Edge Chromatic Number of C_m∨W_n
图C_m∨W_n的点可区别边色数
14.
Relations among the Parameters of Hypergraphs and Colourings of Hypergraphs;
超图各参数间的关系以及超图的边色数问题
15.
Two Upper Bound of the Adjacent Strong Edge Coloring and the Adjacent Vertex Distinguishing Total Coloring of General Mycielski-Graphs
广义Mycielski图的邻强边色数和邻点可区别全色数的两个上界
16.
A graph with maximum degree 5 has a strong edge colouring with at most 38 colours.
最大度等于5的图的强边色数至多为38.
17.
The Adjacent-Vertex Distinguishing Edge Coloring and the Fractional Coloring of Graphs;
图的邻点可区别的边染色和分数染色
18.
The Lower Bound on the Size of Edge-Coloring Critical Graph & the Fractional Edge Coloring of Some Graphs;
临界图边数的下界与某些图类的分数边染色