On the number of genus embeddings of complete bipartite graphs

zbMATH Open1324.05134MaRDI QIDQ5260072FDOQ5260072

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

Publication date: 29 June 2015

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}\)

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)

Cited In (11)

• Lower bound on the number of the maximum genus embedding of \(K_{n,n}\)
• The Bidimensional Theory of Bounded-Genus Graphs
• On the number of genus embeddings of complete tripartite graph.
• Genus of \(C_{m,n}\) and strong genus embedding of \(K_{m,n}\)
• On the number of genus embeddings of complete bipartite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Infinite families of bi-embeddings
• A remark on embedded bipartite graphs

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)