The orientable genus is nonadditive

DOI10.1002/jgt.3190100314zbMath0607.05025OpenAlexW2031659294MaRDI QIDQ3745857

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

orientable genusk-amalgamationnonadditiveoriented identified disk spaces

Mathematics Subject Classification ID

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

Related Items (7)

Trading crossings for handles and crosscaps ⋮ Bounds for the average genus of the vertex-amalgamation of graphs ⋮ Permutation-partition pairs. III: Embedding distributions of linear families of graphs ⋮ On the number of maximum genus embeddings of almost all graphs ⋮ Unnamed Item ⋮ Region distributions of some small diameter graphs ⋮ On the non-orientable genus of a 2-connected graph

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