The Open UniversitySkip to content
 

Exponential families of non-isomorphic triangulations of complete graphs

Bonnington, C. P.; Grannell, M. J.; Griggs, T. S. and Siran, J. (2000). Exponential families of non-isomorphic triangulations of complete graphs. Journal of Combinatorial Theory, Series B, 78(2) pp. 169–184.

DOI (Digital Object Identifier) Link: https://doi.org/10.1006/jctb.1999.1939
Google Scholar: Look up in Google Scholar

Abstract

We prove that the number of non-isomorphic face 2-colourable triangulations of the complete graph $K_n$ in an orientable surface is at least $2^{n^2/54 -O(n)}$ for $n$ congruent to 7 or 19 modulo 36, and is at least $2^{2n^2/81 -O(n)}$ for $n$ congruent to 19 or 55 modulo 108.

Item Type: Journal Item
ISSN: 0095-8956
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID: 22793
Depositing User: Mike Grannell
Date Deposited: 18 Aug 2010 13:46
Last Modified: 16 Oct 2017 08:38
URI: http://oro.open.ac.uk/id/eprint/22793
Share this page:

Metrics

Altmetrics from Altmetric

Citations from Dimensions

Actions (login may be required)
CORE (COnnecting REpositories)

Policies | Disclaimer

© The Open University   contact the OU