On the Genus of Strong Tensor Products of Graphs
Brian L. Garman, Richard D. Ringeisen, Arthur T. White ยท Canadian Journal of Mathematics ยท 1976
The genus parameter for graphs has been studied extensively in recent years, with impetus given primarily by the Ringel-Youngs solution to the Heawood Map-coloring Problem [15]. This solution involved the determination of ๐(Kn), the genus of the complete graph Kn.