The nonorientable genus is additive
From MaRDI portal
Publication:3745856
Recommendations
- The orientable genus is nonadditive
- The nonorientable genus of the join of two cycles
- Nonadditivity of the 1-genus of a graph
- The nonorientable genus problem for one-relator products
- Genus is superadditive under band connected sum
- scientific article; zbMATH DE number 4019088
- Nonorientable genera of Petersen powers
- The non-orientable genus of some metacyclic groups
- Nonorientable slice genus can be arbitrarily large
- An additivity theorem for the genus of a graph
Cites work
Cited in
(16)- On the non-orientable genus of a 2-connected graph
- An additivity theorem for the genus of a graph
- Genus is superadditive under band connected sum
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- Characterization of the maximum genus of a signed graph
- On the number of maximum genus embeddings of almost all graphs
- Nonadditivity of the 1-genus of a graph
- Irreducible triangulations of surfaces with boundary
- The orientable genus is nonadditive
- scientific article; zbMATH DE number 15491 (Why is no real title available?)
- Trading crossings for handles and crosscaps
- scientific article; zbMATH DE number 7559239 (Why is no real title available?)
- Subgraph densities in a surface
- Pre-signed graphs: a reformulation of signed graphs and their embeddings
- Region distributions of some small diameter graphs
- Irreducible triangulations are small
This page was built for publication: The nonorientable genus is additive
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745856)
