1.
(d,1)-Total labeling of the product of path and cycle graph
路与圈的积图的(d,1)-全标号
2.
On the Crossing Numbers of the Cartesian Products of Circular Graph and Some Special Graphs with Paths、Stars、Trees and Cycles
关于循环图及一些特殊图与路、星、树和圈的笛卡尔积的交叉数研究
3.
Decycling Number of Cartesian product of Complete Graph and Tree,Cycle,Complete Graph,Complete Bipartitle Graph
完全图与树、圈、完全图、完全二部图的笛卡尔乘积图的消圈数
4.
The Binding Number of cartesian product of circuit and comprete bipartite graph
圈与完全偶图的笛卡尔乘积的联结数
5.
The Geodetic Number of Cartesian Product on Cycles and Complete Graphs
关于圈与完全图的笛卡儿积的测地数
6.
In Chapter two, we prove that the cartesian product graphs of a cycle and a path satisfy the list edge coloring conjecture.
第二章证明了由圈和路构成的(笛卡儿)积图满足图的边列表着色猜想。
7.
The Crossing Numbers of Cartesian Products of Paths with 6-Vertex Graphs
6-阶图与路的笛卡儿积交叉数(英文)
8.
On Cycles and Paths of P_3-dominated Graphs and (K_(1, 4); 2)-graphs;
P_3-控制图和（K_（1，4）；2）-图的圈和路
9.
Componentwise Complementary Cycles and Complementary Cycles in Multipartite Tournaments;
多部竞赛图中的分量共轭圈与共轭圈
10.
Some Results on Independent 4-Cycle and 6-Cycle in Graphs;
图中独立4-圈与独立6-圈的相关结论
11.
I. Listen, circke @T@ for the right answer and @F@ for the wrong answer.
听句子，判断。与图相符的圈@T@，与图不符的圈@F@。
12.
I. Listen. Circle @T@ for the right answer and @F@for the wrong answer.
听句子，与图相符的圈“T”，与图不符的圈“F”。
13.
ON INCIDENCE CHROMATIC NUMBER OF P_N×K_M AND K(n,m);
路与完全图的笛卡尔积图和广义图K(n,m)的关联色数
14.
The L(2,1)-Labelings on General Mycielski Graph Of Path and Cycle;
路和圈的广义Mycielski图的L(2,1)标号
15.
The Crossing Number of Cartesian Product of P_n with Circulant Graph C(10,2)
循环图C(10,2)与路P_n的笛卡尔积的交叉数
16.
Evaluation of eigenactions of area and volume operators in loop quantum gravity
圈量子引力中面积与体积算符本征作用的估值
17.
On the Gracefulness of Graphs C_n∪T_k
圈C_n与树T_k生成的单圈图的优美性及其它标号
18.
The Circuit Transient Process of Mutual Inductance Loop and its Magnetic Energy;
互感线圈电路的暂态过程与互感线圈的磁能