The following theorem has been proved in this paper: “For each non-negative integer p,the chromatic number of the graph of genus p can be any integer m，2≤m≤[7+√1+48p/2]. It then leads to the conclusion that it is impossible to find out the sufficient and necessary condition for m-chromation graph if m≥3.