Quotients of complete multipartite graphs
Cho Sit · Pacific Journal of Mathematics · 1976
The principal result of this paper is the determination of every graph that can be covered by a complete multipartite graph, in the usual topological sense of covering spaces.Various papers of S.R. Alpert, J.L. Gross, and T.W. Tucker have explicitly recognized that knowing what a given graph covers is helpful in constructing surface imbeddings for it, acknowledging that this approach is the underlying secret in the combinatorial current graph method of W. Gustin.Moreover, the fact that every Cayley graph covers a bouquet of circles is of implicit importance in other work on Cayley graph imbeddings, such as that of A.T. White on the genus of a group.