On the number of nonisomorphic orientable regular embeddings of complete graphs

DOI10.1006/JCTB.2000.1993zbMath1025.05017OpenAlexW2023344889MaRDI QIDQ1850510

Vladimir P. Korzhik, Heinz-Juergen Voss

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.1993

zbMATH Keywords

complete graphorientable surfaceorientable embeddings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (37)

On the number of triangular embeddings of complete graphs and complete tripartite graphs ⋮ Edge-transitive embeddings of complete graphs ⋮ Cyclic bi‐embeddings of Steiner triple systems on 12s + 7 points ⋮ On the number of genus embeddings of complete bipartite graphs ⋮ Triangular embeddings of complete graphs from graceful labellings of paths ⋮ Minimum genus embeddings of the complete graph ⋮ Oriented matroids and complete-graph embeddings on surfaces ⋮ Dihedral biembeddings and triangulations by complete and complete tripartite graphs ⋮ Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs ⋮ Minimal quadrangulations of surfaces ⋮ Face distributions of embeddings of complete graphs ⋮ Doubly even orientable closed 2-cell embeddings of the complete graph ⋮ Another proof of the map color theorem for nonorientable surfaces. ⋮ Unnamed Item ⋮ A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs ⋮ A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s ⋮ Some triangulated surfaces without balanced splitting ⋮ Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\) ⋮ A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs ⋮ Graceful labelling: state of the art, applications and future directions ⋮ A lower bound for the number of orientable triangular embeddings of some complete graphs ⋮ On the maximal distance between triangular embeddings of a complete graph. ⋮ Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\) ⋮ Vertex transitive embeddings of complete graphs ⋮ Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\) ⋮ The edge-regular complete maps ⋮ Exponential families of non-isomorphic triangulations of complete graphs ⋮ Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments ⋮ Exponentially many maximum genus embeddings and genus embeddings for complete graphs ⋮ Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs ⋮ Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph ⋮ Cayley maps ⋮ Quadrangular embeddings of complete graphs and the even map color theorem ⋮ Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs. ⋮ Biembeddings of 2-rotational Steiner triple systems ⋮ Even Embeddings of the Complete Graphs and Their Cycle Parities ⋮ Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)

Cites Work

• Minimal quadrangulations of orientable surfaces
• A sequence representation for maps
• Face 2-colourable triangular embeddings of complete graphs
• Three nonisomorphic triangulations of an orientable surface with the same complete graph
• Exponential families of non-isomorphic triangulations of complete graphs
• Uniqueness and faithfulness of embedding of toroidal graphs
• Surface embeddings of Steiner triple systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of nonisomorphic orientable regular embeddings of complete graphs