论文信息 - Recursive constructions for triangulations

Recursive constructions for triangulations

Three recursive constructions are presented; two deal with embeddings of complete graphs and one with embeddings of complete tripartite graphs. All three facilitate the construction of 2an2-o(n2) non-isomorphic face 2-colourable triangulations of Kn and Kn,n,n in orientable and non-orientable surfaces for values of n lying in certain residue classes and for appropriate constants a. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 87–107, 2002

Mike J. Grannell | Terry S. Griggs | Jozef Širáň

[1] Seiya Negami,et al. Three nonisomorphic triangulations of an orientable surface with the same complete graph , 1994, Discret. Math..

[2] Mike J. Grannell,et al. Face 2-Colourable Triangular Embeddings of Complete Graphs , 1998, J. Comb. Theory, Ser. B.

[3] G. Ringel,et al. Über das Problem der Nachbargebiete auf orientierbaren Flächen , 1961 .

[4] Jonathan L. Gross,et al. Topological Graph Theory , 1987, Handbook of Graph Theory.

[5] R. C. Bose. ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS , 1939 .

[6] Mike J. Grannell,et al. Surface embeddings of Steiner triple systems , 1998 .

[7] Richard M. Wilson,et al. Nonisomorphic Steiner triple systems , 1974 .

[8] Mike J. Grannell,et al. Exponential Families of Non-Isomorphic Triangulations of Complete Graphs , 2000, J. Comb. Theory, Ser. B.

[9] G. Ringel. Map Color Theorem , 1974 .