On the non-orientable genus of a 2-connected graph
From MaRDI portal
Publication:1074593
DOI10.1016/0095-8956(87)90029-3zbMath0591.05026OpenAlexW2094473531MaRDI QIDQ1074593
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)90029-3
Related Items (5)
The nonorientable genus is additive ⋮ Excluded minors for the Klein bottle. I: Low connectivity case ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Matroids Determine the Embeddability of Graphs in Surfaces ⋮ On the Euler genus of a 2-connected graph
Cites Work
- Embedding graphs in surfaces
- On the Euler genus of a 2-connected graph
- Computing the genus of the 2-amalgamations of graphs
- An additivity theorem for the genus of a graph
- The genus of the 2-amalgamations of graphs
- The nonorientable genus is additive
- The orientable genus is nonadditive
- Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings
- Blocks and the nonorientable genus of graphs
- Additivity of the genus of a graph
This page was built for publication: On the non-orientable genus of a 2-connected graph
