Grannell, M. J. and Knor, M.
A lower bound for the number of orientable triangular embeddings of some complete graphs.
Journal of Combinatorial Theory, Series B, 100(2) pp. 216–225.
(Click here to request a copy from the OU Author.
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 of the complete graph Kn in an orientable surface is at least nan2.
Actions (login may be required)