1.
A sufficient condition for graphs to be(g,f,k)-critical graphs
(g,f,k)-临界图的一个充分条件
2.
Some Research on the Factors of Graphs, (g,f)-k-deleted Graphs and (g,f)-k-covered Graphs;
关于图的因子、（g,f）-k-消去图和（g,f）-k-覆盖图的研究
3.
The Degree Condition of k-vertices Deletable ID-factor-critical Graphs;
k点可删的ID-因子临界图的度条件
4.
On Bipartite G-Designs (Where G has four vertices or less);
(m,n,k,1)偶图G—设计(K≤4)
5.
End with Smaller Cardinality and Atom in Contraction-Critical k-Connected Graphs;
收缩临界k连通图中的原子及阶较小的端片
6.
(g,f)-factorization of(mg+1,mf)-graphs
(mg+1,mf)-图的(g,f)-因子分解
7.
A degree condition for graphs to have Hamiltonian(g,f)-factors
图有哈密顿(g,f)-因子的度条件
8.
SUBGRAPHS WITH (g ,f)-FACTORIZATIONS ORTHOGONAL TO A SUBGRAPH IN GRAPHS;
具有与任意图正交的(g,f)-因子分解的子图
9.
4-colouring of dual G(p,q,f) of a 32-face sphere development
32面体展开图的对偶图G(p,q,f)的4着色
10.
Some Construction Methods of k-Intercept Width Critical Tree (k≥3);
k–割宽临界树的一些构造方法(k≥3)
11.
(g,f)-Factorization with constraints in bipartite graphs
二分图上有限制条件的(g,f)-因子分解(英文)
12.
In the schematic diagram (fig.9), gears C, E, G, and K are sliding gears.
如图9所示，齿轮组C,E,g及K是变速齿轮组。
13.
On the value distribution of f~((k))f~n
关于f~((k))f~n的值分布
14.
What does K. G. signify?
k. G.是什么意思？
15.
G. O. K. @ Stood for?
“G. O. k. 代表什么？”
16.
(g.f)-Factorizations (m,r)-Orthogonal to an Arbitrary Subgraph in Several Types of Graph;
在几类图中与任意子图（m，r）-正交的（g，f）-因子分解
17.
The Bounds of Critical Function for (k,s)-SAT;
关于（k，s）-SAT临界函数上下界的研究
18.
A: The surname's Wang m W-A-N-G. Her name is Fangfang F-A-N-G-F-A-N-G.
甲：姓是王 W-A-N-G，名字是芳芳 F-A-N-G-F-A-N-G。