Abstract
We prove that the number of non-isomorphic face 2-colourable triangulations of the complete graph Kn in an orientable surface is at least 2n2/54-O(n) for n congruent to 7 or 19 modulo 36, and is at least 22n2/81-O(n) for n congruent to 19 or 55 modulo 108. © 2000 Academic Press.
Cite
CITATION STYLE
APA
Bonnington, C. P., Grannell, M. J., Griggs, T. S., & Širáň, J. (2000). Exponential Families of Non-Isomorphic Triangulations of Complete Graphs. Journal of Combinatorial Theory. Series B, 78(2), 169–184. https://doi.org/10.1006/jctb.1999.1939
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free