论文信息 - Surface embeddings of Steiner triple systems

Surface embeddings of Steiner triple systems

A Steiner triple system of order n (STS(n)) is said to be embeddable in an orientable surface if there is an orientable embedding of the complete graph Kn whose faces can be properly 2-colored (say, black and white) in such a way that all black faces are triangles and these are precisely the blocks of the STS(n). If, in addition, all white faces are triangular, then the collection of all white triangles forms another STS(n); the pair of such STS(n)s is then said to have an (orientable) bi-embedding. We study several questions related to embeddings and bi-embeddings of STSs. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 325–336, 1998

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

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

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

[4] Arnold Emch. Triple and multiple systems, their geometric configurations and groups , 1929 .

[5] Arthur T. White. Efficient Imbeddings of Finite Projective Planes , 1995 .

[6] M. Colbourn,et al. On Cyclic Steiner 2-Designs , 1980 .

[7] Arthur T. White,et al. Block designs and graph imbeddings , 1978, J. Comb. Theory B.

[8] Ian Anderson,et al. Infinite families of biembedding numbers , 1979, J. Graph Theory.

[9] Joan Marie Rahn. On the Genus of a Block Design , 1984 .

[10] Ian Anderson,et al. Current graphs and bi-embeddings , 1978, J. Graph Theory.

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

[12] Ian Anderson,et al. Triples, current graphs and biembeddings , 1982 .

[13] R. D. Ringeisen,et al. On the genus of strong tensor products of graphs , 1976 .

[14] Timothy R. S. Walsh,et al. Hypermaps versus bipartite maps , 1975 .

[15] Seth R. Alpert,et al. Twofold Triple Systems and Graph Imbeddings , 1975, J. Comb. Theory, Ser. A.