摘要
By the orientable genus γ（G） of graph G=（V, E）, we mean the minimum among the genera of the surfaces into which G can be embadded. Kn is the complete graph with n vertices. Kn-K3 is the graph which is obtained by erasing the throe edges of a circuit of length 3 from Kn, Ringel has proved
