We explore a novel method to generate and characterize complex networks by means of
their embedding on hyperbolic surfaces. Evolution through local elementary moves allows …

In this paper we consider those 2-cell orientable embeddings of a complete graph Kn+ 1
which are generated by rotation schemes on an abelian group Φ of order n+ 1, where a …

The face-hypergraph, H (G), of a graph G embedded in a surface has vertex set V (G), and
every face of G corresponds to an edge of H (G) consisting of the vertices incident to the …

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 …

Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of
Complete Graphs Page 1 Journal of Combinatorial Theory, Series B 86, 186–211 (2002) doi:10.1006/jctb.2002.2122 …

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 …

For every surface S (orientable or non-orientable), we give a linear time algorithm to test the
graph isomorphism of two graphs, one of which admits an embedding of face-width at least …

We consider a notion of embedding digraphs on orientable surfaces, applicable to digraphs
in which the indegree equals the outdegree for every vertex, ie, Eulerian digraphs. This idea …

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 …