1.
The Degree Condition of k-vertices Deletable ID-factor-critical Graphs;
k点可删的ID-因子临界图的度条件
2.
End with Smaller Cardinality and Atom in Contraction-Critical k-Connected Graphs;
收缩临界k连通图中的原子及阶较小的端片
3.
Some Results on [k, k+1]-Factor of Graph;
关于图的[k，k+1]-因子的若干结果
4.
Maximal Non-ID-f actor-critical Graphs
极大非独立集可削去的因子临界图(英文)
5.
A sufficient condition for graphs to be(g,f,k)-critical graphs
(g,f,k)-临界图的一个充分条件
6.
A Short Proof of A Conjecture;
k-因子的Hamiltonian
7.
Some Research on the Factors of Graphs, (g,f)-k-deleted Graphs and (g,f)-k-covered Graphs;
关于图的因子、（g,f）-k-消去图和（g,f）-k-覆盖图的研究
8.
The K_(1,k～-)-factorization of complete bipartite graphs;
完全二部图的K_(1,k～-)因子分解
9.
K_(l,k)-Factorisation of Complete Bipartite Multigraphs;
完全二部多重图的K_(1,k)-因子分解
10.
Application of CAXA in Process & Instrumentation Diagram
CAXA电子图板在P&ID中的应用
11.
Some Construction Methods of k-Intercept Width Critical Tree (k≥3);
k–割宽临界树的一些构造方法(k≥3)
12.
Further Research of the k/N: G Redundant System with Repair and Multiple Critical and Non-critical Errors;
带临界和非临界故障的可修k/N：G冗余表决系统的进一步研究
13.
The New Lower Bound of the Number of Vertices of Degree 5 and Trivially Noncontractible Edges in Contraction Critical 5 Connected Graphs;
收缩临界5连通图的5度顶点数和平凡不可收缩边数的新的下界
14.
N-Factor-Criticality and Hamilton-Connectivity in Graph Theorey;
图论中的N-因子-临界性与哈密尔顿连通性
15.
Click to delete the subweb for the selected project.
单击此处可删除所选项目的子站点。
16.
Session ID hijacking can be a problem with PHP Websites.
截获会话id可以说是PHP网站所面临的一个问题。
17.
ADJACENT STRONG VERTEX-DISTINGUISHING TOTAL COLORING OF P_n~k(k≡2(mod 3));
P_n~k(k≡2(mod3))的邻点可区别的强全染色
18.
The Bounds of Critical Function for (k,s)-SAT;
关于（k，s）-SAT临界函数上下界的研究