|
Zapiski Nauchnykh Seminarov POMI, 2000, Volume 266, Pages 76–106
(Mi znsl1240)
|
|
|
|
This article is cited in 31 scientific papers (total in 31 papers)
On the structure of $k$-connected graphs
D. V. Karpov, A. V. Pastor St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences
Abstract:
For $k$-connected graph we determine a notion of block and build a block tree. These constructions generalize well known and important in graph theory notion of block for the case of $k$-connected graph. With the help of these notions we describe such set $W$ of vertices of $k$-connected graph, that one can delete from graph
any subset of $W$ without less of vertex connectivity.
Received: 10.10.1999
Citation:
D. V. Karpov, A. V. Pastor, “On the structure of $k$-connected graphs”, Representation theory, dynamical systems, combinatorial and algoritmic methods. Part V, Zap. Nauchn. Sem. POMI, 266, POMI, St. Petersburg, 2000, 76–106; J. Math. Sci. (N. Y.), 113:4 (2003), 584–597
Linking options:
https://www.mathnet.ru/eng/znsl1240 https://www.mathnet.ru/eng/znsl/v266/p76
|
Statistics & downloads: |
Abstract page: | 527 | Full-text PDF : | 361 |
|