| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657112 | Journal of Combinatorial Theory, Series B | 2010 | 10 Pages |
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 Kn in an orientable surface is at least nan2.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
