Throughout this thesis we consider finite undirected simple connected graphs.
我们考虑的都是有限无向的简单连通图。
参考来源 - 前三个最大特征值的3树和图类（？）（n，m）·2,447,543篇论文数据，部分数据来源于NoteExpress
In this paper, some properties of removable edge in 4-connected graphs are obtained.
给出了4连通图中可去边的一些性质。
The topological sorting algorithm works on unconnected graphs as well as connected graphs.
拓扑排序算法既可以用于连通图，也可以用于非连通图。
This paper presents a survey on the properties and distributions of contractible edges and removable edges in 3 connected graphs.
综述了3连通图中可缩边和可去边的性质以及它们在图中的分布情形。
应用推荐