Related papers: A cactus theorem for end cuts
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…
A cactus is a connected graph in which each edge is contained in at most one cycle. We generalize the concept of cactus graphs, i.e., a $k$-cactus is a connected graph in which each edge is contained in at most $k$ cycles where $k\ge 1$. It…
We give a short, topological proof that all graphs admit tree-decompositions displaying their topological ends.
This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…
A network can be analyzed by means of many graph theoretical parameters. In the context of networks analysis, closeness is a structural metric that evaluates a node's significance inside a network. A cactus is a connected graph in which any…
We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.
We prove that the edge-end space of an infinite graph is metrizable if and only if it is first-countable. This strengthens a recent result by Aurichi, Magalhaes Jr.\ and Real (2024). Our central graph-theoretic tool is the use of tree-cut…
We generalise structure tree theory, which is based on removing finitely many edges, to removing finitely many vertices. This gives a significant generalization of Tutte's tree decomposition of 2-connected graphs into 3-connected blocks.…
Recently, Kawarabayashi and Thorup presented the first deterministic edge-connectivity recognition algorithm in near-linear time. A crucial step in their algorithm uses the existence of vertex subsets of a simple graph $G$ on $n$ vertices…
We prove that every graph which admits a tree-decomposition into finite parts has a rooted tree-decomposition into finite parts that is linked, tight and componental. As an application, we obtain that every graph without half-grid minor has…
Phylogenetic networks are a generalization of evolutionary or phylogenetic trees that are commonly used to represent the evolution of species which cross with one another. A special type of phylogenetic network is an {\em $X$-cactus}, which…
In this paper, we build on recent results by Chauve et al. (2014) and Bahrani and Lumbroso (2017), which combined the split-decomposition, as exposed by Gioan and Paul, with analytic combinatorics, to produce new enumerative results on…
There are different definitions of ends in non-locally-finite graphs which are all equivalent in the locally finite case. We prove the compactness of the end-topology that is based on the principle of removing finite sets of vertices and…
We prove that every graph has a canonical tree of tree-decompositions that distinguishes all principal tangles (these include the ends and various kinds of large finite dense structures) efficiently. Here `trees of tree-decompositions' are…
A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digraph the least size of an edge set meeting every dicut equals…
A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we consider several problems of graph theory and developed optimal algorithms to solve such problems on cactus graphs. The running time of…
We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles. This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and the extension to…
We show that if a subset $\Psi$ of the ends of a graph $G$ can be displayed by a tree-decomposition of finite adhesion, then it can also be displayed by a linked such tree-decomposition. This tree-decomposition captures all combinatorial…
One model of message delivery in a computer network is based on labelling each edge by a subset of a (reasonably small) universal set, and then encoding a path as the union of the labels of its edges. Earlier work suggested using random…
The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…