Title of article
Exponential Families of Non-Isomorphic Triangulations of Complete Graphs
Author/Authors
Bonnington، نويسنده , , C.Paul and Grannell، نويسنده , , M.J. and Griggs، نويسنده , , T.S. and ?ir??، نويسنده , , J.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
16
From page
169
To page
184
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.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2000
Journal title
Journal of Combinatorial Theory Series B
Record number
1526606
Link To Document