  We describe an infinite family of edge-decompositions of complete graphs into
two graphs, each of which triangulate the same orientable surface. Previously,
such decompositions had only been known for only a few complete graphs. These
so-called biembeddings solve a generalization of the Earth-Moon problem for an
infinite number of orientable surfaces.
