Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs

DOI10.1016/j.disc.2015.09.031zbMath1327.05243OpenAlexW2161925975MaRDI QIDQ898131

Vladimir P. Korzhik

Publication date: 8 December 2015

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

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

zbMATH Keywords

complete graphjoin of graphstopological embeddingtriangular embedding

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Dihedral biembeddings and triangulations by complete and complete tripartite graphs
• Biembeddings of metacyclic groups and triangulations of orientable surfaces by complete graphs
• 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
• The orientable genus of some joins of complete graphs with large edgeless graphs
• Minimal triangulations on orientable surfaces
• On the genus of joins and compositions of graphs
• Triangular embeddings of \(K_n-K_m\) with unboundedly large \(m\)
• On biembeddings of Latin squares
• Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs
• The nonorientable genus of joins of complete graphs with large edgeless graphs
• On the number of triangular embeddings of complete graphs and complete tripartite graphs
• Biembedding a Steiner Triple System With a Hamilton Cycle Decomposition of a Complete Graph

This page was built for publication: Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs