1.
An Algorithm of Constructing a Connected Graph from a Connectible Sequence;
可连通图序列的一个连通图实现的构造算法
2.
The(Adjacent) Tree Graph of a Connected Graph Is Upper Embeddable;
连通图的(邻接)树图的上可嵌入性
3.
On Cyclability and Strong Pushability in a Kind of Graphs;
关于一类图的可圈性与强连通可推性
4.
The Cycles in 2-connected [4, 2]-graphs and the Fully Cycle Extensibility of Graphs with High Connectivity;
2-连通[4，2]-图中的圈与高连通度图的完全圈可扩性
5.
Adjacent vertex distinguishing total coloring on 2-connected outer plane graph
2-连通外平面图的邻点可区别全染色
6.
The Wiener Indices of Connected Graph and Disconnected Graph;
连通图和不连通图的维纳指数W(G)
7.
Judging the Irreducibility of Matrices by Use of the Strong Connexity of Directed Graphs;
利用有向图的强连通性判断方阵的不可约性
8.
A noncomplete6 connected graph is called contraction-critical if it has no any6- contractible edge.
一个不包含6可收缩边的非完全图被称为收缩临界6连通图.
9.
Independence Number、Connectivity and Hamilton-connectivity;
图的独立数、连通度与Hamilton连通性
10.
The Connectivity of <E_C(G)>IN 3,4-Connected Graph;
3,4-连通图G中<E_C(G)>的连通性
11.
The Relationship of Connected Matroid M and Connected Graph G(D~#)
M是连通拟阵与G(D~#)是连通图的关系
12.
G is a minimal connected graph.
G是一个极小连通图。
13.
5-connected Graphs and the Hamilton Question;
5-连通图与Hamilton问题
14.
Connectivity of Two Classes of Bi-Cayley Graphs;
两类Bi-Cayley图的连通性
15.
Restricted Edge Connectivity of de Bruijn Digraphs and Graphs;
de Bruijn图的限制边连通度
16.
The Degree Sequence of Connected Graphs and the Number of Lower Degree Vertices of Connected Plannar Graphs
连通图的度序列及连通平面图的低度点个数
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.
Adjacent-vertex-distinguishing Total Coloring on 2-connected Outer Plane Graph with△(G)=6;
关于△(G)=6的2-连通外平面图的邻点可区别全染色