Abstract. The genus of a complete graph equals the least integer greater than or equal to (E-3V+6)/6, whereE andV are the numbers of edges and vertices of the graph. This paper extends the class of graphs known to have this property, concentrating on graphs whose number of vertices is congruent to 6 modulo 12.