【摘要】 本文证明了:对于任何一个有圈连通图G,其不可定向最大亏格为这里,α₀,α₁分别为G的顶点和边的数目.从而,也解决了图的不可定向嵌入的存在性问题.更多还原

【Abstract】 In this paper, we provide a new embedding technique to prove the following formula where _M（G） is the maximum non-orientable genus of a graph G; G is connected with at least one circuit, i.e. it is any connected graph but tree; a₀ and a₁ are the number of vertices and edges in the graph G respectively.Also, we solve the existence problem of non-orientable 2-cell embeddings, i.e. cellular embeddings of a graph constructively at the same time.更多还原