A CACTUS THEOREM FOR END CUTS

DOI10.1142/S0218196714500076zbMath1286.05078arXiv1110.5084MaRDI QIDQ5410744

Anastasia Evangelidou, Panos Papasoglu

Publication date: 17 April 2014

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.5084

zbMATH Keywords

endscactuscuts

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Groups acting on trees (20E08) Infinite graphs (05C63)

Related Items (max. 100)

Vertex Cuts ⋮ A descriptive construction of trees and Stallings’ theorem

Cites Work

• Unnamed Item
• Cyclic splittings of finitely presented groups and the canonical JSJ deccomposition
• Homotopy equivalences of 3-manifolds with boundaries
• Cut points and canonical splittings of hyperbolic groups
• The algebraic torus theorem
• A geometric proof of Stallings' theorem on groups with more than one end.
• Cutting up graphs
• On the extraconnectivity of graphs
• On torsion-free groups with infinitely many ends
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• A Fast Algorithm for Optimally Increasing the Edge Connectivity
• MINIMAL CUBINGS

This page was built for publication: A CACTUS THEOREM FOR END CUTS