On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\) (Q2410034): Difference between revisions

For a subset \(S\) of the vertex set of a graph \(G\), let \(k(S)\) denote the maximum number of edge-disjoint trees of \(G\) such that each pair of these trees have exactly \(S\) in common. The \(k\)-connectivity of \(G\) is defined as \(\kappa_{k}(G)=\min\{\kappa(S)|S \subseteq V(G) \text{ and }|S|=k\}\). In this paper, the authors characterize the set of minimally 2-connected graphs with \(k_{3}=2\).