An additivity theorem for the genus of a graph

DOI10.1016/0095-8956(87)90028-1zbMath0618.05020OpenAlexW2060482148MaRDI QIDQ1088997

Gary Lee Miller

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90028-1

zbMATH Keywords

closed surfaceembedding of graphsamalgamation of graphsgeneralized genus

Mathematics Subject Classification ID

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

Related Items (11)

Subgraph densities in a surface ⋮ Irreducible triangulations of surfaces with boundary ⋮ The \(\mathbb{Z}_2\)-genus of Kuratowski minors ⋮ The nonorientable genus is additive ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Characterization of groups with planar, toroidal or projective planar (proper) reduced power graphs ⋮ Irreducible triangulations are small ⋮ Unnamed Item ⋮ The obstructions for toroidal graphs with no \(K_{3,3}\)'s ⋮ On the Euler genus of a 2-connected graph ⋮ On the non-orientable genus of a 2-connected graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for imbedding cubic graphs in the torus
• Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus
• Combinatorial Oriented Maps
• Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings
• Erratum to "Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings"
• Blocks and the nonorientable genus of graphs
• Additivity of the genus of a graph
• The Genera of Amalgamations of Graphs
• Ramified coverings of Riemann surfaces

This page was built for publication: An additivity theorem for the genus of a graph