Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)

DOI10.1016/j.disc.2008.01.027zbMath1167.05020OpenAlexW2045645894MaRDI QIDQ1011722

Vladimir P. Korzhik

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.027

zbMATH Keywords

complete graphorientable surfacecurrent grouptopological embeddingindex three current graphnonisomorphic triangular embedding

Mathematics Subject Classification ID

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

Related Items

On the number of triangular embeddings of complete graphs and complete tripartite graphs, Dihedral biembeddings and triangulations by complete and complete tripartite graphs, A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s, Genus embeddings of a type of graph, A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs, Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\), Exponentially many maximum genus embeddings and genus embeddings for complete graphs, Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph, Even Embeddings of the Complete Graphs and Their Cycle Parities

Cites Work

• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• Exponential families of non-isomorphic triangulations of complete graphs
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
• Recursive constructions for triangulations
• Unnamed Item
• Unnamed Item