|
Zapiski Nauchnykh Seminarov POMI, 2002, Volume 293, Pages 59–93
(Mi znsl1676)
|
|
|
|
This article is cited in 21 scientific papers (total in 21 papers)
Blocks in $k$-connected graphs
D. V. Karpov St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences
Abstract:
For a $k$-connected graph with the help of local vertex connectivity we determine a notion of block and prove some properties of blocks, which generalize the properties of classic biconnected blocks. We investigate the structure of division of a $k$-connected graph by several cutting sets.
Received: 15.12.2002
Citation:
D. V. Karpov, “Blocks in $k$-connected graphs”, Computational complexity theory. Part VII, Zap. Nauchn. Sem. POMI, 293, POMI, St. Petersburg, 2002, 59–93; J. Math. Sci. (N. Y.), 126:3 (2005), 1167–1181
Linking options:
https://www.mathnet.ru/eng/znsl1676 https://www.mathnet.ru/eng/znsl/v293/p59
|
Statistics & downloads: |
Abstract page: | 269 | Full-text PDF : | 289 |
|