D. V. Karpov, “Vertex cuts in a <nobr>$k$</nobr>-connected graph”, Zap. Nauchn. Sem. POMI, 2006, Volume 340,Pages <nobr>33

This article is cited in 22 papers

Vertex cuts in a $k$-connected graph

D. V. Karpov

St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences

Abstract: 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.

UDC: 519.173.1

Received: 12.12.2006