In this paper, an algorithm based on graph theory and various aspects of optimization strategy is presented. Examination timetabling is an important part of the examination management activities. The results of the examination timetabling have an important influence on the management activities. By the establishment of a static conflict graph, we transtport the timing graph into a graph coloring problem and propose several optimization strategies on the results after analyzing and abstracting on the university's examination room arrangements. The experiment at ShanDong Agricultural University shows that our algorithm is quite effective in solving the complex problem in automatic timetabling.