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 …

We show that for s≥ 11 there are at least 22s− 11 nonisomorphic orientable triangular
embeddings of K12s+ 3. The result completes the proof that there are constants M, c> 0, b≥ …

We prove that for every prime number p and odd m> 1, as s→∞, there are at least w face 2‐
colorable triangular embeddings of Kw, w, w, where w= m· ps. For both orientable and …

Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph - Korzhik - 2013 -
Journal of Graph Theory - Wiley Online Library Skip to Article Content Skip to Article …

We construct biembeddings of some Latin squares which are Cayley tables of dihedral
groups. These facilitate the construction of n^ an^ 2 nonisomorphic face 2-colourable …

We present a family of index 1 abelian current graphs whose derived embeddings can be
modified into triangular embeddings of K 12 s for s≥ 3. Our construction is significantly …

In 2003, Liu set up the joint tree model such that an embedding of a graph on a surface can
be represented by a joint tree, further by an associated surface of it. In this paper, by dividing …

The complete graph on n vertices can be quadrangularly embedded on an orientable (resp.
nonorientable) closed surface F2 with Euler characteristic if and only if (resp. and). In this …

We construct several families of minimum genus embeddings of dense graphs using index 2
current graphs. In particular, we complete the genus formula for the octahedral graphs …

An existing construction for face 2-colourable triangular embeddings of complete regular
tripartite graphs is extended and then re-examined from the viewpoint of the underlying Latin …