说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 句库 -> 点可区别边色数
1.
ON VERTEX-DISTINGUISHING EDGE CHROMATIC NUMBER OF C_m∨C_n AND C_m∨S_n;
关于C_m∨C_n和C_m∨S_n的点可区别边色数
2.
On the Vertex-distinguishing Edge Chromatic Number of S_m∨W_n
图S_m∨W_n的点可区别边色数
3.
D(3)-vertex-distinguishable proper edge-chromatic number of C_m·P_n
C_m·P_n的D(3)-点可区别边色数
4.
Vertex-Distinguishing Edge Chromatic Number of C_m∨W_n
图C_m∨W_n的点可区别边色数
5.
One Upper Bound on the D(2)-Vertex-Distinguishing Chromatic Numbers of Graphs
图的距离不大于2的点可区别边色数的一个上界
6.
The Adjacent-Vertex Distinguishing Edge Coloring and the Fractional Coloring of Graphs;
图的邻点可区别的边染色和分数染色
7.
Vertex-Distinguishing Edges Coloring of (S_m~*S_n);
图S_m~*S_n的点可区别的边色数
8.
Adjacent Strong Edge Chromatic Number and Adjacent Vertex Distinguishing Total Chromatic Number of Two Classes of Operator Graphs;
两类运算图的邻强边色数与邻点可区别全色数
9.
The Adjacent Vertex-Distinguishing Edge Coloring of C_m·S_n;
C_m·S_n的邻点可区别边染色
10.
D(2)-Vertex Distinguishing Proper Edge Coloring and Vertex Distinguishing Proper Edge Coloring of Graphs;
图的D(2)-点可区别及点可区别正常边染色
11.
Two Upper Bound of the Adjacent Strong Edge Coloring and the Adjacent Vertex Distinguishing Total Coloring of General Mycielski-Graphs
广义Mycielski图的邻强边色数和邻点可区别全色数的两个上界
12.
On the Vertex-distinguishing Edge Coloring and Adjacent Strong Edge Coloring of Join-graph and Double Graph of Some Graphs;
若干联图及倍图的(邻)点可区别边染色
13.
On the Adjacent-vertex Distinguishing Edge Coloring of C_(5m)×C_(5n);
C_(5m)×C_(5n)图的邻点可区别的边染色
14.
ADJACENT VERTEX-DISTINGUISHING EDGES COLORING OF(P_n∨P_m);
P_n∨P_m的邻点可区别边染色
15.
On Some Adjacent Vertex- distinguishing Edge Total Coloring of Double Graphs
关于若干倍图的邻点可区别边全染色
16.
Distinguishing Equitable Edge Coloring of the Vertex C_mοS_n
冠图C_mοS_n的点可区别的均匀边染色
17.
(Adjacent) Vertex-distinguishing Total Colorings and Fractional Colorings of Graphs;
图的(邻)点可区别全染色和分数染色
18.
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的邻点可区别全色数