Recursive constructions for triangulations

被引：37

作者：

Grannell, MJ

Griggs, TS

Sirán, J

机构：

[1] Open Univ, Dept Pure Math, Milton Keynes MK7 6AA, Bucks, England

[2] Slovak Univ Technol Bratislava, Dept Math, SVF, Bratislava 81368, Slovakia

来源：

JOURNAL OF GRAPH THEORY | 2002年 / 39卷 / 02期

关键词：

topological embedding; triangulation of K-n; K-n; complete graph; complete tripartite graph; Steiner triple system; non-isomorphic embeddings;

D O I：

10.1002/jgt.10014

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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 2(an2 - o(n)2) non-isomorphic face 2-colourable triangulations of K-n and K-n,K-n,K-n in orientable and non-orientable surfaces for values of n lying in certain residue classes and for appropriate constants a. (C) 2002 John Wiley Sons, Inc.

引用

页码：87 / 107

页数：21

共 10 条

[1]

[Anonymous], 1974, MAP COLOR THEOREM, DOI DOI 10.1007/978-3-642-65759-7

[2] Exponential families of non-isomorphic triangulations of complete graphs [J].