| 1. | The sum of all the degree is 24, an even number, which is twice the number of edges .
所有次数的和是24，是个偶数，它是边数的两倍。 |
| 2. | Category - i maximal graphs with given number of path - hamilton edges
边数的一类极图 |
| 3. | Chromatic number with forbidden paths for graphs of large size
大边数图的禁止路色数 |
| 4. | An edge - number property of graphs with k3 - free
不含三角形图的一个边数性质 |
| 5. | From the left hand several second pressed key
从左手边数起第二个按键。 |
| 6. | Counts from the left hand the second keystroke
从左手边数起第二个按键 |
| 7. | A note on maximum number of edges in a spanning eulerian subgraph
生成子图极大边数的一个注记 |
| 8. | A method to probe into the number of edges of spanning eulerian subgraph
生成子图边数的一种方法 |
| 9. | If you click inside the polygon , the number of sides increases
如果单击多边形的内部，则边数增加。 |
| 10. | If you click outside the polygon , the number of sides decreases
如果单击多边形的外部，则边数减少。 |
