We prove that, for a certain positive constant a and for an infinite set of values of n, the number of nonisomorphic face 2-colourable triangular embeddings ...

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 ...

We prove that, for a certain positive constant a and for an infinite set of values of n, the number of nonisomorphic face 2-colourable tri- angular embeddings ...

Grannell, M. J. and Knor, M. (2010). A lower bound for the number of orientable triangular embeddings of some complete graphs. Journal of Combinatorial ...

Nov 8, 2007 · A major component of the proof is the establishment of a similar lower bound on the number of nonisomorphic face 2-colourable triangular ...

A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs ; Genus Distribution of Graph Amalgamations: ...

In this paper, we describe the generation of all nonorientable triangular embeddings of the complete graphs K12 and K13. (The 59 nonisomorphic orientable ...

Sep 6, 2012 · The best existing lower bounds for the number of triangular embeddings of a complete graph Kz K z in an orientable surface are of the form zz2(a ...

[8] M. J. Grannell and M. Knor, A lower bound for the number of orientable triangular embeddings of some complete graphs, J. Combin. Theory Ser. B. 100 ...

Aug 28, 2010 · In this paper, we study lower bound of the number of maximum orientable genus embeddings (or MGE in short) for a loopless graph.