An additivity theorem for the genus of a graph
type: Item
instance of: scholarly article
title: An additivity theorem for the genus of a graph
zbMATH Open document ID: 0618.05020
DOI: 10.1016/0095-8956(87)90028-1
author: Gary L. Miller
published in: Journal of Combinatorial Theory. Series B
publication date: 1987-01-01T00:00:00Z
review text: The generalized genus g(G) of a connected graph G is defined as \(g(G)=\min \{\gamma (G),{\tilde \gamma}(G)\}\) where \(\gamma\) (G), \({\tilde \gamma}\)(G) are the orientable and non-orientable genera of G, respectively. It is proved that if G is obtained from disjoint connected graphs \(H_ 1\) and \(H_ 2\) by identifying an edge (vertex) in \(H_ 1\) with an edge (vertex) in \(H_ 2\) then \(g(G)=g(H_ 1)+g(H_ 2)\). The proofs utilize a new combinatorial representation of embeddings.
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 4002116
zbMATH Keywords: amalgamation of graphs
zbMATH Keywords: embedding of graphs
zbMATH Keywords: closed surface
zbMATH Keywords: generalized genus
reviewed by: Jozef Širáň
MaRDI profile type: MaRDI publication profile
full work available at URL: 0095-8956(87)90028-1
OpenAlex ID: W2060482148
cites work: The Genera of Amalgamations of Graphs
cites work: Additivity of the genus of a graph
cites work: An algorithm for imbedding cubic graphs in the torus
cites work: Ramified coverings of Riemann surfaces
cites work: Q5615284
cites work: Q3670594
cites work: Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus
cites work: Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings
cites work: Erratum to "Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings"
cites work: Blocks and the nonorientable genus of graphs
cites work: Q5672655
cites work: Combinatorial Oriented Maps
cites work: Q4156452
description: scientific article; zbMATH DE number 4002116