MAXIMUM GENUS AND CHROMATIC NUMBER OF GRAPHS
图的最大亏格与图的着色数

Abstract Combined with the edge-connectivity of graphs, this paper gives an upperbound of Betti deficiency on a graph in terms of chromatic number of its complement, provesthat this bound is the best possible, and obtains some new results on the lower bounds of themaximum genus of graphs.