The nonorientable genus of the join of two cycles
From MaRDI portal
(Redirected from Publication:383653)
Recommendations
- The nonorientable genus of joins of complete graphs with large edgeless graphs
- The orientable genus of the join of a cycle and a complete graph
- Genus of \(C_{m,n}\) and strong genus embedding of \(K_{m,n}\)
- On the non-orientable genus of a 2-connected graph
- The orientable genus of some joins of complete graphs with large edgeless graphs
Cites work
- Der vollständige paare Graph auf nichtorientierbaren Flächen.
- Genus embeddings for some complete tripartite graphs
- Graphs on surfaces
- scientific article; zbMATH DE number 3708283 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- scientific article; zbMATH DE number 3422404 (Why is no real title available?)
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- The nonorientable genus of complete tripartite graphs
- The nonorientable genus of joins of complete graphs with large edgeless graphs
Cited in
(6)- The orientable genus of some joins of complete graphs with large edgeless graphs
- The nonorientable genus of joins of complete graphs with large edgeless graphs
- Genus of \(C_{m,n}\) and strong genus embedding of \(K_{m,n}\)
- The nonorientable genus is additive
- The orientable genus of the join of a cycle and a complete graph
- Settling the nonorientable genus of the nearly complete bipartite graphs
This page was built for publication: The nonorientable genus of the join of two cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383653)
