A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
The problems of calculating the genus of the complete graphs and of finding a minimum triangulation for each surface were both solved using the theory of current graphs, and each of them divided into twelve different cases, depending on the residue modulo 12 of the number of vertices. Cases 8 and 11 were of particular difficulty for both problems, with multiple families of current graphs developed to solve these cases. We solve these cases, in addition to Cases 6 and 9, in a unified manner,doi:10.26493/1855-3974.2006.fa4 fatcat:yn6rbhlucrdtrp62tncyuj4p5u