We present a theory of Cayley maps, ie, embeddings of Cayley graphs into oriented
surfaces having the same cyclic rotation of generators around each vertex. These maps …

Exponential Families of Non-Isomorphic Triangulations of Complete Graphs Page 1 Journal
of Combinatorial Theory, Series B 78, 169 184 (2000) Exponential Families of Non-Isomorphic …

This paper takes a close look at graceful labelling and its applications. We pay special
attention to the famous Graceful Tree Conjecture, which has attracted a lot of interest and …

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 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 show that to each graceful labelling of a path on 2s+ 1 vertices, s⩾ 2, there corresponds
a current assignment on a 3-valent graph which generates at least 22s cyclic oriented …

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 …