|
Zapiski Nauchnykh Seminarov POMI, 2006, Volume 340, Pages 33–60
(Mi znsl149)
|
|
|
|
This article is cited in 22 scientific papers (total 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.
Received: 12.12.2006
Citation:
D. V. Karpov, “Vertex cuts in a $k$-connected graph”, Combinatorics and graph theory. Part I, Zap. Nauchn. Sem. POMI, 340, POMI, St. Petersburg, 2006, 33–60; J. Math. Sci. (N. Y.), 145:3 (2007), 4953–4966
Linking options:
https://www.mathnet.ru/eng/znsl149 https://www.mathnet.ru/eng/znsl/v340/p33
|
Statistics & downloads: |
Abstract page: | 320 | Full-text PDF : | 270 | References: | 52 |
|