Name
Abstract | ||
|---|---|---|
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 2,=81 O(n) for n congruent to 19 or 55 modulo 108. 3 |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1006/jctb.1999.1939 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
complete graph,non-isomorphic triangulations,exponential family | Discrete mathematics,Complete graph,Graph,Combinatorics,Modulo,Exponential family,Isomorphism,Congruence (geometry),Primitive root modulo n,Mathematics | Journal |
Volume | Issue | ISSN |
78 | 2 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
31 | 4.00 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Paul Bonnington | 1 | 100 | 19.95 |
| M. J. Grannell | 2 | 101 | 13.68 |
| T. S. Griggs | 3 | 144 | 27.54 |
| J. Širáň | 4 | 51 | 6.05 |