We pursue the problem of counting the imbeddings of a graph in each of the orientable
surfaces. We demonstrate how to achieve this for an iterated amalgamation of arbitrarily …

An embedding of a graph in a surface gives rise to a combinatorial design whose blocks
correspond to the faces of the embedding. Particularly interesting graphs include complete …

We present a quadratic-time algorithm for computing the genus distribution of any 3-regular
outerplanar graph. Although recursions and some formulas for genus distributions have …

We prove that, for a certain positive constant a and for an infinite set of values of n, the
number of nonisomorphic triangular embeddings of the complete graph Kn is at least …

We present a general method for calculating the genus distributions of those infinite families
of graphs that are obtained by iteratively amalgamating copies of some base graphs along …

Counting the number of imbeddings in various surfaces of each of the graphs in an
interesting family is an ongoing topic in topological graph theory. Our special focus here is …

Archdeacon, in his seminal paper $[1] $, defined the concept of Heffter array in order to
provide explicit constructions of $\mathbb {Z} _ {v} $-regular biembeddings of complete …

A lower bound for the number of orientable triangular embeddings of some complete graphs
Page 1 Journal of Combinatorial Theory, Series B 100 (2010) 216–225 Contents lists …

This article aims to provide exponential lower bounds on the number of non-isomorphic $ k
$-gonal biembeddings of the complete multipartite graph into orientable surfaces. For this …

Exponential families of nonisomorphic nonorientable genus embeddings of complete
graphs Page 1 http://www.elsevier.com/locate/jctb Journal of Combinatorial Theory, Series …