Determination of regular embeddings of graphs on surfaces

Abstract

In this paper, a (n - 1, n)-embedding of complete graph Kn of order n on some surface is provided. In the same way, a double cover of Kn by n - 1 circuits of length n is provided. After this, nearly regular embeddings of some graphs are also provided too. Moreover, all of these support the small circuit double cover conjecture.