The orientable genus is nonadditive

DOI10.1002/JGT.3190100314MaRDI QIDQ3745857zbMATH OpenOpenAlexFDO

Authors Dan S. Archdeacon

Publication date 1986

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190100314

zbMATH Keywords

k-amalgamationnonadditiveorientable genusoriented identified disk spaces

Mathematics Subject Classification ID

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

Recommendations

• The nonorientable genus is additive
• scientific article; zbMATH DE number 15491
• Computing the genus of the 2-amalgamations of graphs
• Bounds for the average genus of the vertex-amalgamation of graphs
• An additivity theorem for the genus of a graph

Cited in

(14)

• On the non-orientable genus of a 2-connected graph
• An additivity theorem for the genus of a graph
• Permutation-partition pairs. III: Embedding distributions of linear families of graphs
• On the number of maximum genus embeddings of almost all graphs
• Nonadditivity of the 1-genus of a graph
• Bounds for the average genus of the vertex-amalgamation of graphs
• A genus inequality of the union graphs
• The nonorientable genus is additive
• 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?)
• The genus of edge amalgamations of a type of graph
• Pre-signed graphs: a reformulation of signed graphs and their embeddings
• Region distributions of some small diameter graphs

This page was built for publication: The orientable genus is nonadditive

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