Genus of C_m,n and strong genus embedding of K_m,n

DOI10.3969/J.ISSN.1000-5641.2011.02.003MaRDI QIDQ3109341zbMATH OpenFDO

Authors Songling Shan, Han Ren

Publication date 27 January 2012

Full work available at URL https://doi.org/10.3969/J.ISSN.1000-5641.2011.02.003

zbMATH Keywords

genusnonorientable genusstrong embedding

Mathematics Subject Classification ID

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

Recommendations

• The orientable genus of the join of a cycle and a complete graph
• The nonorientable genus of the join of two cycles
• The nonorientable genus of joins of complete graphs with large edgeless graphs
• On the number of genus embeddings of complete bipartite graphs
• On the number of genus embeddings of complete bipartite graphs

Cited in

(7)

• The orientable genus of some joins of complete graphs with large edgeless graphs
• Maximum genus of strong embeddings
• The nonorientable genus of joins of complete graphs with large edgeless graphs
• scientific article; zbMATH DE number 3939383 (Why is no real title available?)
• The nonorientable genus of the join of two cycles
• On the number of genus embeddings of complete bipartite graphs
• Nonorientable strong maximum genus of G(2m+1,m)

This page was built for publication: Genus of \(C_{m,n}\) and strong genus embedding of \(K_{m,n}\)

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