×

Vertex cuts in a \(k\)-connected graph. (Russian, English) Zbl 1116.05043

Zap. Nauchn. Semin. POMI 340, 33-60 (2006); translation in J. Math. Sci., New York 145, No. 3, 4953-4966 (2007).
Summary: We study the structure of \(k\)-vertex cuts in a \(k\)-vertex-connected graph. A case of a biconnected graph is described in details as an illustration for our method.

MSC:

05C40 Connectivity