On the number of genus embeddings of complete bipartite graphs

MaRDI QIDQ5260072zbMATH OpenFDO

Authors Zeling Shao, Xiangmei Zhang, Zhiguo Li, Jihuan Wang

Publication date 29 June 2015

zbMATH Keywords

orientable surfaceminimum genusjoint treeorientable embedding

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• On the number of genus embeddings of complete bipartite graphs
• Genus embeddings of a type of graph
• On the number of genus embeddings of complete tripartite graph.
• Lower bound on the number of the maximum genus embedding of \(K_{n,n}\)
• Genus of \(C_{m,n}\) and strong genus embedding of \(K_{m,n}\)

Cited in

(11)

• On the number of genus embeddings of complete tripartite graph.
• Infinite families of bi-embeddings
• A remark on embedded bipartite graphs
• scientific article; zbMATH DE number 718634 (Why is no real title available?)
• Lower bound on the number of the maximum genus embedding of \(K_{n,n}\)
• Genus of \(C_{m,n}\) and strong genus embedding of \(K_{m,n}\)
• On the number of genus embeddings of complete bipartite graphs
• scientific article; zbMATH DE number 1874438 (Why is no real title available?)
• scientific article; zbMATH DE number 1960647 (Why is no real title available?)
• The Bidimensional Theory of Bounded-Genus Graphs
• scientific article; zbMATH DE number 4135963 (Why is no real title available?)

This page was built for publication: On the number of genus embeddings of complete bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5260072)