Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
Lowell W. Beineke · Canadian Journal of Mathematics · 1969
Although the problem of finding the minimum number of planar graphs into which the complete graph can be decomposed remains partially unsolved, the corresponding problem can be solved for certain other surfaces. For three, the torus, the double-torus, and the projective plane, a single proof will be given to provide the solutions. The same questions will also be answered for bicomplete graphs.