Fundamental Cycles and Graph Embeddings
  In this paper we present a new Good Characterization of maximum genus of a graph which makes a common generalization of the works of Xuong, Liu, and Fu et al. Based on this, we find a new polynomially bounded algorithm to find the maximum genus of a graph. 
Han Ren, Hongtao Zhao, Haoling Li