Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs

DOI10.1016/j.disc.2015.05.024zbMath1318.05045OpenAlexW586151124MaRDI QIDQ2515556

Vladimir P. Korzhik

Publication date: 5 August 2015

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

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

zbMATH Keywords

complete graphtopological embeddingminimal embeddingtriangular embeddingnonisomorphic embeddings

Mathematics Subject Classification ID

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

Related Items (2)

A simple proof of the map color theorem for nonorientable surfaces ⋮ Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Dihedral biembeddings and triangulations by complete and complete tripartite graphs
• Exponential families of nonisomorphic nonorientable genus embeddings of 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
• Exponential families of non-isomorphic triangulations of complete graphs
• On biembeddings of Latin squares
• On the number of triangular embeddings of complete graphs and complete tripartite graphs
• Recursive constructions for triangulations

This page was built for publication: Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs