A cactus theorem for end cuts
Combinatorics
2011-10-25 v1
Abstract
Dinits-Karzanov-Lomonosov showed that it is possible to encode all minimal edge cuts of a graph by a tree-like structure called a cactus. We show here that minimal edge cuts separating ends of the graph rather than vertices can be `encoded' also by a cactus. We apply our methods to finite graphs as well and we show that several types of cuts can be encoded by cacti.
Keywords
Cite
@article{arxiv.1110.5084,
title = {A cactus theorem for end cuts},
author = {Anastasia Evangelidou and Panos Papasoglu},
journal= {arXiv preprint arXiv:1110.5084},
year = {2011}
}
Comments
19 pages