Considering systems of separations in a graph that separate every pair of a given set of vertex sets that are themselves not separated by these separations, we determine conditions under which such a separation system contains a nested subsystem that still separates those sets and is invariant under the automorphisms of the graph.As an application, we show that the k-blocks -the maximal vertex sets that cannot be separated by at most k vertices -of a graph G live in distinct parts of a suitable tree-decomposition of G of adhesion at most k, whose decomposition tree is invariant under the automorphisms of G. This extends recent work of Dunwoody and Krön and, like theirs, generalizes a similar theorem of Tutte for k = 2.Under mild additional assumptions, which are necessary, our decompositions can be combined into one overall tree-decomposition that distinguishes, for all k simultaneously, all the k-blocks of a finite graph.

We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject to the requirement that they commute with graph isomorphisms. In particular, all the decompositions constructed are invariant under the automorphisms of the graph.

A k-block in a graph G is a maximal set of at least k vertices no two of which can be separated in G by fewer than k other vertices. The block number β(G) of G is the largest integer k such that G has a k-block.We investigate how β interacts with density invariants of graphs, such as their minimum or average degree. We further present algorithms that decide whether a graph has a k-block, or which find all its k-blocks.The connectivity invariant β(G) has a dual width invariant, the blockwidth bw(G) of G. Our algorithms imply the duality theorem β = bw: a graph has a block-decomposition of width and adhesion < k if and only if it contains no k-block.

We show that every connected graph has a spanning tree that displays all its topological ends. This proves a 1964 conjecture of Halin in corrected form, and settles a problem of Diestel from 1992. arXiv:1409.6640v5 [math.CO] 6 Feb 2018 Observation 2.5. For proper separations (A, B) and (C, D) the following are equivalent.

In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now establish lower bounds on the number of parts in these decompositions that contain such a block or tangle, and determine conditions under which such parts contain nothing but a k-block.