关于凸n边形的剖分图是欧拉图的问题

The Problem of a Subdivision Graph of the Convex n-polygon Which Is Euler Graph

对n的任意一种分拆(n1,n2):n1+n2=n,n1(0,n2(0,n2(n1(mod3),可得到凸n边形剖分图是(n1,n2)—欧拉图的推论。

In this paper,it is proved that convex n-polygon has some subdivision graphs are(n_1,n_2)-Euler graph,to any partition(n_1,n_2) of n,where n_1+n_2=n,n_2≡n_1(mod3),n_1≥0,n_2≥3.