Exponentially many nonisomorphic orientable triangular embeddings of K₁₂s

DOI10.1016/J.DISC.2007.03.056MaRDI QIDQ2469982zbMATH OpenOpenAlexFDO

Authors Vladimir P. Korzhik

Publication date 11 February 2008

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

complete graphnonisomorphic triangular embeddingorientable surfacetopological embedding

Mathematics Subject Classification ID

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

Recommendations

• A simple construction of exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• A simple construction for orientable triangular embeddings of the complete graphs on 12 s vertices
• A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs

Cites work

• Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
• Exponential families of non-isomorphic triangulations of complete graphs
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3450230 (Why is no real title available?)
• Index four orientable embeddings and case zero of the Heawood conjecture
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• Recursive constructions for triangulations
• The genus of K12s

Cited in

(15)

• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
• Embeddings of an \(M_{12}\) geometry: Some simple combinatorial descriptions
• A simple construction for orientable triangular embeddings of the complete graphs on 12 s vertices
• A nonorientable triangular embedding of \(K_ n-K_ 2\), \(n\equiv 8\pmod{12}\)
• Biembeddings of 2-rotational Steiner triple systems
• Generating nonisomorphic quadrangular embeddings of a complete graph
• On the number of triangular embeddings of complete graphs and complete tripartite graphs
• Dihedral biembeddings and triangulations by complete and complete tripartite graphs
• Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments
• A simple construction of exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
• Even embeddings of the complete graphs and their cycle parities
• Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs
• The number of nonisomorphic nonorientable 6-gonal embeddings of complete graphs
• Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\)
• A lower bound for the number of orientable triangular embeddings of some complete graphs

This page was built for publication: Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469982)