n-connectedness in pure 2-complexes
From MaRDI portal
Publication:1076041
DOI10.1007/BF02786514zbMath0593.05046MaRDI QIDQ1076041
Publication date: 1985
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
paths; edges; simplicial complexes; vertices; 2-complexes; triangles; connectivity of graphs; disjoint; 2-skeleton; Menger-Whitney type
05C10: Planar graphs; geometric and topological aspects of graph theory
05C40: Connectivity
57N99: Topological manifolds
Related Items
On the connectivity of infinite graphs and 2-complexes, Triangles n-Connectivity in Simplicial 2-Complexes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the graph structure of convex polyhedra in \(n\)-space
- Decompositions of homology manifolds and their graphs
- Graph theorems for manifolds
- Zur Theorie der n-fach zusammenhängenden Graphen
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Congruent Graphs and the Connectivity of Graphs
- Short proof of Menger's graph theorem
- On acyclic simplicial complexes
- A theorem on n-connected graphs
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- Cycles and Connectivity in Graphs
- Polytopes, graphs, and complexes
- Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl.
- Extensions of Menger's Theorem†
