Doubly even orientable closed 2-cell embeddings of the complete graph

zbMath1300.05180MaRDI QIDQ405100

Thomas A. McCourt, Michael John Grannell

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p22

zbMATH Keywords

orientable closed 2-cell embeddings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph designs and isomorphic decomposition (05C51)

Related Items (3)

Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \) ⋮ Quadrangular embeddings of complete graphs and the even map color theorem ⋮ Mutually orthogonal cycle systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
• A lower bound for the number of orientable triangular embeddings of some complete graphs
• The orientable genus of some joins of complete graphs with large edgeless graphs
• The topological theory of current graphs
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Exponential families of non-isomorphic triangulations of complete graphs
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• The nonorientable genus of joins of complete graphs with large edgeless graphs
• Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph
• Hamiltonian embeddings from triangulations
• Biembeddings of symmetric \(n\)-cycle systems

This page was built for publication: Doubly even orientable closed 2-cell embeddings of the complete graph