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.
A graph with maximum degree 5 has a strong edge colouring with at most 38 colours.
最大度等于5的图的强边色数至多为38.
7.
On the Adjacent Strong Edge Coloring and 2-strong Edge Coloring of Some Graphs;
若干图类的邻强边染色与2-强边染色问题研究
8.
In the gorge strong sunshine and milky mist are interwoven, within the compass of a few yards you can find both. It is miraculous and incredible.
峡中，强烈的阳光与乳白色云雾交织一处，数步之隔，这边是阳光，那边是云雾，真是神妙莫测。
9.
On The Complete Coloring of W_m·K_n;
关于W_m·K_n的边色数和全色数
10.
ON THE EDGE CHROMATIC NUMBER AND EQUITABLE CHROMATIC NUMBER OF S_m ∨ K_(n,n);
S_m ∨ K_(n,n)的边色数和均匀全色数
11.
The Adjacent-Vertex Distinguishing Edge Coloring and the Fractional Coloring of Graphs;
图的邻点可区别的边染色和分数染色
12.
On the Adjacent Strong Edge Chromatica Number of some Special Complete r-partite Graphs;
一类特殊完全r-部图的邻强边染色
13.
Adjacent Strong Edge Chromatic Number of Cn·Cm,Cn·Fm,Cn·Wm Graphs;
关于图Cn·Cm,Cn·Fm,Cn·Wm的邻强边着色
14.
ON THE ADJACENT STRONG EDGE COLORING OF OUTER PLANAR GRAPHS WITH△(G)≤3;
△(G)=3的外平面图的邻强边染色
15.
The Lower Bound on the Size of Edge-Coloring Critical Graph & the Fractional Edge Coloring of Some Graphs;
临界图边数的下界与某些图类的分数边染色
16.
We shall present some of the basic properties of the vertex and edge chromatic numbers.
我们将介绍顶点色数和边色数的一些基本性质。
17.
Singular Perturbation for Boundary Problem with Two Small Parameter under The Condition of Strong Stability;
强稳定下的两参数边值问题的奇摄动
18.
ON VERTEX-DISTINGUISHING EDGE CHROMATIC NUMBER OF C_m∨C_n AND C_m∨S_n;
关于C_m∨C_n和C_m∨S_n的点可区别边色数