Several theoretical results are obtained by studying symmetric Eulerian graph and symmetric Eulerian trail.
通过对于对称欧拉图和对称欧拉路径的研究，得出了多项理论结果。
It is also shown that the postman route obtained by this approximation algorithm is optimal if the given windy graph is Eulerian.
当所给风向图是欧拉图时，由这一近似算法求得的投递员路线是最优的投递员路线。
A graph G is supereulerian if G has a spanning eulerian subgraph.
若图G含有生成欧拉子图，则称G是超欧拉的。
A graph G is supereulerian if G has a spanning eulerian subgraph.
若图G含有生成欧拉子图，则称G是超欧拉的。
应用推荐