On the structure of vertex cuts separating the ends of a graph

DOI10.2140/PJM.2015.278.479MaRDI QIDQ745100zbMATH OpenOpenAlexFDO

Authors Gareth Wilkes

Publication date 13 October 2015

Published in Pacific Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

cactuscutsendssucculent

Mathematics Subject Classification ID

Connectivity (05C40) Groups acting on trees (20E08) Topological methods in group theory (57M07)

Abstract: Dinits, Karzanov and Lomonosov showed that the minimal edge cuts of a finite graph have the structure of a cactus, a tree-like graph constructed from cycles. Evangelidou and Papasoglu extended this to minimal cuts separating the ends of an infinite graph. In this paper we show that minimal vertex cuts separating the ends of a graph can be encoded by a succulent, a mild generalization of a cactus that is still tree-like. We go on to show that the earlier cactus results follow from our work.

Recommendations

• A cactus theorem for end cuts
• Some results concerning the ends of minimal cuts of simple graphs
• Vertex cuts
• scientific article; zbMATH DE number 1263227
• The tree of cuts and minimal \(k\)-connected graphs

Cited in

(7)

• On the existence of edge cuts leaving several large components
• Some finiteness results concerning separation in graphs
• Vertex cuts
• Structural properties of the minimum cut of partially-supplied graphs
• Some results concerning the ends of minimal cuts of simple graphs
• A cactus theorem for end cuts
• Can you tell a tree from its branches?

This page was built for publication: On the structure of vertex cuts separating the ends of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q745100)