connected spanning subgraph 连通支撑子图
Directed Local Spanning Subgraph 和有向局部生成子图
induced spanning subgraph 诱导生成子图
essential spanning subgraph 基本生成子图
unique-cycle spanning subgraph 单圈支撑子图S
spanning bipartite subgraph 生成偶子图
maximal spanning eulerian subgraph 极大欧拉生成子图
Afterward it is proved that a simple plane graph is a spanning subgraph of a maximal plane graph, so the chromatic number top of a simple plane graph is the chromatic number of the correlative maximal plane graph.
接下来,本文证明了任意一个简单平面图都是某个极大平面图的生成子图,则任意一个简单平面图色数的上界是相应的极大平面图的色数。
参考来源 - 极大平面图的构造方法与几类特殊图的色数分析·2,447,543篇论文数据，部分数据来源于NoteExpress
A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property.
最优化理论中的一个有名的问题要求：用比较容易的方法来寻求具有某种特殊性质的生成子图。
In this paper we proved that every near triangulation without separating triangles has a 2-connected spanning subgraph of maximum degree at most 3 which is the best possible.
证明了每一个无可分离三角形的几乎三角剖分图均存在一个2-连通支撑子图，其最大度至多3．并且，这一结果是最佳可能的。
A graph G is supereulerian if G has a spanning eulerian subgraph.
若图G含有生成欧拉子图，则称G是超欧拉的。
应用推荐