On the Maximum Genus of an Embedded Graph
关于嵌入图的最大亏格

This paper studies the maximum genus of a graph $G $ only in term of some embedding of $G $ in an orientable surface, not of its other invariants, and gives the maximum genus of this kind of graphs.