A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs

DOI10.1016/J.DISC.2007.03.060MaRDI QIDQ2469983zbMATH OpenOpenAlexFDO

Authors Vladimir P. Korzhik, Jin Ho Kwak

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.060

zbMATH Keywords

Steiner systemcomplete graphcurrent graphnonorientable surfacetriangular embeddingnonisomorphic embeddings

Mathematics Subject Classification ID

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

Recommendations

• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
• Exponential families of non-isomorphic triangulations of complete graphs
• Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs
• A simple construction of exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
• On the number of triangular embeddings of complete graphs and complete tripartite graphs

Cites work

• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3756556 (Why is no real title available?)
• scientific article; zbMATH DE number 3450230 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• 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
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• Recursive constructions for triangulations

Cited in

(19)

• Nonorientable biembeddings of Steiner triple systems
• scientific article; zbMATH DE number 2061797 (Why is no real title available?)
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
• A simple construction for orientable triangular embeddings of the complete graphs on 12 s vertices
• A simple construction of exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
• On the number of triangular embeddings of complete graphs and complete tripartite graphs
• On the maximal distance between triangular embeddings of a complete graph.
• Recursive constructions for triangulations
• Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• Face 2-colourable triangular embeddings of complete graphs
• Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices
• A lower bound for the number of orientable triangular embeddings of some complete graphs
• Exponential families of non-isomorphic triangulations of complete graphs
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
• Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness
• Nonisomorphic complete triangulations of a surface
• Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
• Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs

This page was built for publication: A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs

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