Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs

DOI10.1016/j.jctb.2004.02.002zbMath1048.05031OpenAlexW2036085221MaRDI QIDQ598471

Vladimir P. Korzhik, Heinz-Juergen Voss

Publication date: 6 August 2004

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.02.002

zbMATH Keywords

Complete graphGenus embeddingNonisomorphic embeddingsTopological embedding

Mathematics Subject Classification ID

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

Related Items (18)

On the number of triangular embeddings of complete graphs and complete tripartite graphs ⋮ Triangular embeddings of complete graphs from graceful labellings of paths ⋮ Minimum genus embeddings of the complete graph ⋮ Dihedral biembeddings and triangulations by complete and complete tripartite graphs ⋮ A simple proof of the map color theorem for nonorientable surfaces ⋮ A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs ⋮ Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\) ⋮ A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs ⋮ A lower bound for the number of orientable triangular embeddings of some complete graphs ⋮ On the maximal distance between triangular embeddings of a complete graph. ⋮ Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\) ⋮ Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs ⋮ Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\) ⋮ Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments ⋮ Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph ⋮ Biembeddings of 2-rotational Steiner triple systems ⋮ Even Embeddings of the Complete Graphs and Their Cycle Parities ⋮ Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Another proof of the map color theorem for nonorientable surfaces.
• Exponential families of non-isomorphic triangulations of complete graphs
• Generating the triangulations of the projective plane
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
• Tight and untight triangulations of surfaces by complete graphs
• The combinatorial map color theorem
• Recursive constructions for triangulations
• Nonisomorphic complete triangulations of a surface

This page was built for publication: Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs