A well known problem in optimization theory asks for a relatively easy way of finding a spanningsubgraph with a special property.
最优化理论中的一个有名的问题要求：用比较容易的方法来寻求具有某种特殊性质的生成子图。
2
In this paper we proved that every near triangulation without separating triangles has a 2-connected spanningsubgraph of maximum degree at most 3 which is the best possible.