Doubly even orientable closed 2-cell embeddings of the complete graph
zbMATH Open1300.05180MaRDI QIDQ405100FDOQ405100
Authors: Michael John Grannell, Thomas A. McCourt 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- A lower bound for the number of orientable triangular embeddings of some complete graphs
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
- Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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 nonorientable genus of joins of complete graphs with large edgeless graphs
- Biembeddings of symmetric \(n\)-cycle systems
- The orientable genus of some joins of complete graphs with large edgeless graphs
- The topological theory of current graphs
- Generating nonisomorphic quadrangular embeddings of a complete graph
- Hamiltonian embeddings from triangulations
Cited In (8)
- Mutually orthogonal cycle systems
- Even embeddings of the complete graphs and their cycle parities
- Title not available (Why is that?)
- Quadrangular embeddings of complete graphs and the even map color theorem
- A common cover of graphs and 2-cell embeddings
- Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
- Face distributions of embeddings of complete graphs
- Congruence classes of orientable 2-cell embeddings of bouquets of circles and dipoles
This page was built for publication: Doubly even orientable closed 2-cell embeddings of the complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405100)
