| 1. | We call such a spanning subgraph t an economical spanning subgraph .
我们称这样的生成子图T为廉价的生成子图。 |
| 2. | These questions are special cases of the so called forbidden subgraph problem .
这些问题都是所谓禁用子图问题的特殊情形。 |
| 3. | If t is a subgraph of a graph g, then the edges of g not included in t are called links or chords .
如果T是图G的一个子图，则G中不包含在T中的边称为链支或弦。 |
| 4. | The forbidden subgraph problem is a prime example of the rather large family of extremal problems is graph theory .
禁向子图问题是图论中相当大的一类极值问题中的主要例子。 |
| 5. | A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property .
最优化理论中的一个有名的问题要求：用比较容易的方法来寻求具有某种特殊性质的生成子图。 |
| 6. | It only remains to replace each edge of this diagram by a suitable subgraph which bears the information previously given by the direction and colour .
剩下要做的事只是用适当的子图代替这个图解的每条边，使得原来用方向和颜色给出的信息由这个子图来担当。 |
| 7. | A note on maximum number of edges in a spanning eulerian subgraph
生成子图极大边数的一个注记 |
| 8. | All you need to do is create your text in a subgraph
你所要做的是将你的文字创建在一个子图中。 |
| 9. | Tow maximal planar graphs with path bichromatic subgraph only
两个只有路型二色子图的极大平面图 |
| 10. | A method to probe into the number of edges of spanning eulerian subgraph
生成子图边数的一种方法 |
