A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s

DOI10.26493/2590-9770.1387.a84zbMath1454.05032OpenAlexW3120241814MaRDI QIDQ5151496

Vladimir P. Korzhik

Publication date: 19 February 2021

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/2590-9770.1387.a84

zbMATH Keywords

complete graphtopological embeddingtriangular embeddingnonisomorphic embeddings

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
• Exponential families of non-isomorphic triangulations of complete graphs
• A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices
• 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}\)
• On the number of triangular embeddings of complete graphs and complete tripartite graphs
• Recursive constructions for triangulations