证明了生成子图的构造定理。
给出了生成子图和生成子图的计数定理。
In this paper, spanning subgraphs and its counting theorem are given.
最优化理论中的一个有名的问题要求：用比较容易的方法来寻求具有某种特殊性质的生成子图。
A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property.
应用推荐