On the Euler genus of a 2-connected graph
From MaRDI portal
Publication:1074592
DOI10.1016/0095-8956(87)90030-XzbMath0591.05025MaRDI QIDQ1074592
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items (6)
The \(\mathbb{Z}_2\)-genus of Kuratowski minors ⋮ Excluded minors for the Klein bottle. I: Low connectivity case ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Unnamed Item ⋮ Matroids Determine the Embeddability of Graphs in Surfaces ⋮ On the non-orientable genus of a 2-connected graph
Cites Work
- Unnamed Item
- Embedding graphs in surfaces
- On the non-orientable genus of a 2-connected graph
- Computing the genus of the 2-amalgamations of graphs
- An additivity theorem for the genus of a graph
- A Kuratowski theorem for nonorientable surfaces
- The genus of the 2-amalgamations of graphs
- 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
- On the genus of an n-connected graph
- Locally flat imbeddings of topological manifolds
This page was built for publication: On the Euler genus of a 2-connected graph
