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:	http://dx.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 Article
ISSN:	0095-8956
Academic Unit/Department:	Mathematics, Computing and Technology > Mathematics and Statistics
Item ID:	22793
Depositing User:	Mike Grannell
Date Deposited:	18 Aug 2010 13:46
Last Modified:	02 Dec 2010 21:02
URI:	http://oro.open.ac.uk/id/eprint/22793
Share this page:

Altmetrics	Scopus Citations

Actions (login may be required)

	View Item
	Report issue / request change

Policies | Disclaimer

Exponential families of non-isomorphic triangulations of complete graphs

Abstract

Altmetrics

Scopus Citations

Actions (login may be required)