Abstract: Using some special properties of graphs,such as the vertex-set of a graph with a C- division,every
 edge of a graph belonging to a 3-circle,the graph without cut-vertex and so on,the author studies the maximum genus of graphs,and  obtains a class of upper embeddable graphs.

Key words: Betti deficiency number, upper embeddable, maximum genus