Dihedral Biembeddings and Triangulations by Complete and Complete Tripartite Graphs-Reference-Cited by-同舟云学术

Dihedral Biembeddings and Triangulations by Complete and Complete Tripartite Graphs

Published:2012-04-19 Issue:4 Volume:29 Page:921-932
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Grannell M. J.,Knor M.

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00373-012-1163-1.pdf

Reference22 articles.

1. Alpert S.R.: Twofold triple systems and graph imbeddings. J. Combin. Theory Ser. A 18, 101–107 (1975)

2. Bonnington C.P., Grannell M.J., Griggs T.S., Širáň J.: Exponential families of nonisomorphic triangulations of complete graphs. J. Combin. Theory Ser. B 78, 169–184 (2000)

3. Colbourn C.J., Dinitz J.H. (eds.) The CRC Handbook of Combinatorial Designs, 2nd edn. CRC Press, Boca Raton (2006)

4. Colbourn C.J., Rosa A.: Triple Systems. Clarendon Press, New York (1999)

5. Dénes J., Keedwell A.D.: Latin Squares and their Applications. Akadémiai Kiadó/ English Universities Press/Academic Press, Budapest/London/New York (1974)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A simple proof of the Map Color Theorem for nonorientable surfaces;Journal of Combinatorial Theory, Series B;2022-09

2. Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs;Discrete Mathematics;2016-02

3. Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs;Discrete Mathematics;2015-12