1.
On Hamiltonian Properties of 3-γ-critical Graphs;
关于3-γ-临界图的Hamilton性
2.
The Lower Bound on the Size of Edge-Coloring Critical Graph & the Fractional Edge Coloring of Some Graphs;
临界图边数的下界与某些图类的分数边染色
3.
The Degree Condition of k-vertices Deletable ID-factor-critical Graphs;
k点可删的ID-因子临界图的度条件
4.
A sufficient condition for graphs to be(g,f,k)-critical graphs
(g,f,k)-临界图的一个充分条件
5.
Study on Some Properties of Crictical Graphs and Incidence Coloring of Graphs;
临界图的若干性质和图的关联着色的研究
6.
The sufficient and necessary condition for C′_(m,n) graph(a derivation of Hamilton Critical graph C_(m,n)) to exist in Hamilton Cycle
Hamilton临界图C_(m,n)的派生图类C′_(m,n)的简单性质
7.
Maximal Non-ID-f actor-critical Graphs
极大非独立集可削去的因子临界图(英文)
8.
Application of Volume Profit Graph in the Sensitivity Analysis of Profit;
量利式盈亏临界图在利润敏感性分析中的应用
9.
Discussion on the Problems about Volume-Profit Graph;
关于量利式盈亏临界图有关问题的探讨——关于文献[1]的质疑
10.
The New Lower Bound of the Number of Vertices of Degree 6 in Contraction Critical 6 Connected Graphs;
收缩临界6连通图中6度顶点数新的下界
11.
Calculate Approximately Critical Load of Tenuous Long Compressive Bar by Chart Multiplication Method;
细长压杆临界载荷的图乘法近似求解
12.
A Note on the p Critical 2-Edge-Connected Graph;
关于p阶临界2边连通图的一个注记
13.
End with Smaller Cardinality and Atom in Contraction-Critical k-Connected Graphs;
收缩临界k连通图中的原子及阶较小的端片
14.
N-Factor-Criticality and Hamilton-Connectivity in Graph Theorey;
图论中的N-因子-临界性与哈密尔顿连通性
15.
The Analysis to Bifurcation of Critical Points of Gaussian Scale Space Model
图像Gauss尺度空间模型的临界点分岔分析
16.
GC Fingerprint and Cluster Analysis of Supercritical CO_2 extracts from Propolis Collected in Various Areas of China
国产蜂胶超临界CO_2萃取物GC指纹图谱的建立
17.
The New Lower Bound of the Number of Vertices of Degree 5 and Trivially Noncontractible Edges in Contraction Critical 5 Connected Graphs;
收缩临界5连通图的5度顶点数和平凡不可收缩边数的新的下界
18.
A noncomplete6 connected graph is called contraction-critical if it has no any6- contractible edge.
一个不包含6可收缩边的非完全图被称为收缩临界6连通图.