Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\)

DOI10.1016/j.disc.2010.06.038zbMath1209.05065OpenAlexW2046836420MaRDI QIDQ710593

Vladimir P. Korzhik

Publication date: 19 October 2010

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

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

zbMATH Keywords

bipartite graphtopological embeddinggenus embedding

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Genus embeddings of a type of graph
• 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
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
• Das Geschlecht des vollständigen paaren Graphen
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
• Recursive constructions for triangulations
• Der vollständige paare Graph auf nichtorientierbaren Flächen.