| 释义 |
Euler graph
基本例句
计欧拉图
Euler graphergodicity is a famous question of graph theory, which study how to pass by all of the points without repetition along the graph, and last return the point of departure .欧拉图形遍历是图论上的很著名的研究方向，即研究什么条件下的图可以不重复的走过所有的点并返回原地点。
The Problem of a Subdivision Graph of the Convex n-polygon Which Is Euler Graph关于凸n边形的剖分图是欧拉图的问题
On the List Colorings of the Bipartite Graphs and Euler Graphs关于二部图和欧拉图的列表着色 |