Title of article
A lower bound for the number of orientable triangular embeddings of some complete graphs
Author/Authors
Grannell، نويسنده , , M.J. and Knor، نويسنده , , M.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
10
From page
216
To page
225
Abstract
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 K n in an orientable surface is at least n a n 2 .
Keywords
Steiner triple system , Complete Graph , Triangular embedding , Latin square
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2010
Journal title
Journal of Combinatorial Theory Series B
Record number
1528024
Link To Document