%0 Journal Article
%T Fundamental Cycles and Graph Embeddings
%A Han Ren
%A Hongtao Zhao
%A Haoling Li
%J Mathematics
%D 2008
%I arXiv
%R 10.1007/s11425-009-0041-7
%X 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.
%U http://arxiv.org/abs/0807.1652v1