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

The orientable genus of some joins of complete graphs with large edgeless graphs

Published:2009-03 Issue:5 Volume:309 Page:1190-1198
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Ellingham M.N.,Stephens D. Christopher

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference18 articles.

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

2. David L. Craft, Surgical techniques for constructing minimal orientable imbeddings of joins and compositions of graphs, Ph.D. Thesis, Western Michigan University, 1991

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

4. The nonorientable genus of joins of complete graphs with large edgeless graphs;Ellingham;J. Combin. Theory Ser. B,2007

5. Counterexamples to the nonorientable genus conjecture for complete tripartite graphs;Ellingham;European J. Combin.,2005

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

1. The Genus of a Graph: A Survey;Symmetry;2023-01-23

2. Finite Groups Whose Co-prime Order Graphs Have Positive Genus;Proceedings of the Bulgarian Academy of Sciences;2022-09-30

3. Finite groups whose noncyclic graphs have positive genus;Acta Mathematica Hungarica;2020-03-30

4. On zero-divisor graphs of commutative rings without identity;Journal of Algebra and Its Applications;2019-12-05

5. The orientable genus of the join of a cycle and a complete graph;Ars Mathematica Contemporanea;2019-10-02