The nonorientable genus is additive

DOI10.1002/jgt.3190100313zbMath0607.05024OpenAlexW1985897248MaRDI QIDQ3745856

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.3190100313

zbMATH Keywords

additivenonorientable genusidentified disk spacesk-amalgamation

Mathematics Subject Classification ID

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

Related Items (10)

Subgraph densities in a surface ⋮ Trading crossings for handles and crosscaps ⋮ Irreducible triangulations of surfaces with boundary ⋮ 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 ⋮ Irreducible triangulations are small ⋮ Unnamed Item ⋮ Region distributions of some small diameter graphs ⋮ On the non-orientable genus of a 2-connected graph

Cites Work

• On the non-orientable genus of a 2-connected graph
• An additivity theorem for the genus of a graph

This page was built for publication: The nonorientable genus is additive