The nonorientable genus of joins of complete graphs with large edgeless graphs-Reference-Cited by-同舟云学术

The nonorientable genus of joins of complete graphs with large edgeless graphs

Published:2007-09 Issue:5 Volume:97 Page:827-845
ISSN:0095-8956
Container-title:Journal of Combinatorial Theory, Series B
language:en
Short-container-title:Journal of Combinatorial Theory, Series B

Author:

Ellingham M.N.,Stephens D. Christopher

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference26 articles.

1. The Foundations of Topological Graph Theory;Bonnington,1995

2. Orientable and nonorientable genus of the complete bipartite graph;Bouchet;J. Combin. Theory Ser. B,1978

3. D.L. Craft, Surgical techniques for constructing minimal orientable imbeddings of joins and compositions of graphs, PhD thesis, Western Michigan University, 1991

4. On the genus of joins and compositions of graphs;Craft;Discrete Math.,1998

5. M.N. Ellingham, C. Stephens, The orientable genus of some joins of complete graphs with large edgeless graphs, Submitted

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

1. Biembeddings of cycle systems using integer Heffter arrays;Journal of Combinatorial Designs;2020-09-28

2. Nilpotent graphs with crosscap at most two;AKCE International Journal of Graphs and Combinatorics;2018-12-01

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

4. Face 2-Colorable Embeddings with Faces of Specified Lengths;Journal of Graph Theory;2015-08-12

5. Biembeddings of Symmetric $$n$$ n -Cycle Systems;Graphs and Combinatorics;2015-03-04