1.
An Algorithm of Constructing a Connected Graph from a Connectible Sequence;
可连通图序列的一个连通图实现的构造算法
2.
The Degree Sequence of Connected Graphs and the Number of Lower Degree Vertices of Connected Plannar Graphs
连通图的度序列及连通平面图的低度点个数
3.
Necessary and Sufficient Conditions of Degree Sequences either for Strongly Connected Graphs or Primitive Graphs
强连通图和本原图的度序列的充要条件
4.
On Potentially W_(6-)graphic Sequences
蕴含W_(6-)可图序列(英文)
5.
Inter-well connectivityanalysis based on nonlinear time series
非线性时间序列井间连通性分析方法
6.
The Ordering of the Connected Graphs with the Smallest Laplacian Spectral Radii;
连通图的最小Laplace谱半径的排序
7.
You can choose the icon and program group for your connection.
您可以为连接选择图标和程序组。
8.
The(Adjacent) Tree Graph of a Connected Graph Is Upper Embeddable;
连通图的(邻接)树图的上可嵌入性
9.
List Coloring the Square of 2-connected Outerplanar Graph
2-连通外部平面图的平方图的列表染色
10.
The Problem of Criterion on Potentially _kC_l-Graphic Sequences;
关于蕴含_kC_l可图序列的刻划问题
11.
Characterizations on Potentially K_6-H-graphic Sequences
关于蕴含K_6-H-可图序列的刻划
12.
On Potentially K_3∪K_4-graphic Sequences
蕴含K_3∪K_4的可图序列(英文)
13.
A Characterization On Potentially K_4+P_2-graphic Sequences
蕴含K_4+P_2-可图序列的刻划(英文)
14.
Graphic Sequences that Have a Realization Containing an K_(r+1)
有一个实现包含K_(r+1)的可图序列
15.
Potentially F'_(k_1,k_2,1)-graphic Sequences
蕴含F'_(k_1,k_2,1)-可图序列(英文)
16.
Potentially K_5-E(P_2)-graphic Sequences
蕴含K_5-E(P_2)的正可图序列
17.
The Smallest Degree Sum That Yields Potentially K_(1,2,3)-graphic Sequences
蕴含K_(1,2,3)可图序列的最小度和
18.
On Potentially K_5-Z_4-graphic Sequences
蕴含K_5-Z_4可图序列的刻划