1.
The edge coloring of complete graph satisfying the two-color P_4
满足2色P_4条件完全图的边着色
2.
Adjacent Strong Edge Chromatic Number of Cn·Cm,Cn·Fm,Cn·Wm Graphs;
关于图Cn·Cm,Cn·Fm,Cn·Wm的邻强边着色
3.
Round-robin Tournaments K_(2n)~(i) and k-edge Colouring of Edge Matrix K′_(2n);
循环赛图K_(2n)~(i)与边矩阵K′_(2n)的K-边着色
4.
The determination of pefext matchings of a complete graph K_(4n) on the basic of △(G′)-edge colouring;
基于完全二分图矩阵的△(G)-边着色求解完全图K_(4n)的完备匹配
5.
Matchings, Cycles in Edge-Colored Graphs and Circular Coloring of Graphs;
边染色图中的匹配、圈及图的圆染色
6.
ON THE EDGE LIST COLORING OF SERIES-PARALLEL GRAPHS;
Series-Parallel图的边列表染色
7.
Some Results on Circular Coloring and P-circular Coloring of Graphs;
图的圆着色及p-圆着色的若干结论
8.
Having a border or an edge of distinctive color or pattern.
有边的有一个特殊色彩或图案的边界或边的
9.
The Incidence Coloring and Adjacent Vertex Distinguishing Incidence Coloring of Graphs;
图的关联着色与邻点可区别关联着色
10.
ADJACENT STRONG EDGE COLORING OF MYCIELSKI GRAPH OF WHEEL GRAPH;
轮图的广义Mycielski图的邻强边色数
11.
The Lower Bound on the Size of Edge-Coloring Critical Graph & the Fractional Edge Coloring of Some Graphs;
临界图边数的下界与某些图类的分数边染色
12.
The Adjacent-Vertex Distinguishing Edge Coloring and the Fractional Coloring of Graphs;
图的邻点可区别的边染色和分数染色
13.
On the Vertex-distinguishing Edge Coloring and Adjacent Strong Edge Coloring of Join-graph and Double Graph of Some Graphs;
若干联图及倍图的（邻）点可区别边染色
14.
On the Adjacent Strong Edge Coloring and 2-strong Edge Coloring of Some Graphs;
若干图类的邻强边染色与2-强边染色问题研究
15.
Color Image Edge Detection Based on Color Triangle
基于颜色三角形的彩色图像边缘检测
16.
In Chapter two, we prove that the cartesian product graphs of a cycle and a path satisfy the list edge coloring conjecture.
第二章证明了由圈和路构成的(笛卡儿)积图满足图的边列表着色猜想。
17.
Traceability of Graph and Discussion of Coloring Property of Product of Graphs;
图的可迹性和直积图着色性质的讨论
18.
On the Adjacent-vertex Distinguishing Edge Coloring of C_(5m)×C_(5n);
C_(5m)×C_(5n)图的邻点可区别的边染色