Standard

Blocks in k-connected graphs. / Karpov, D. V.

In: Journal of Mathematical Sciences, Vol. 126, No. 3, 01.01.2005, p. 1167-1181.

Research output: Contribution to journal › Article › peer-review

Harvard

Karpov, DV 2005, 'Blocks in k-connected graphs', Journal of Mathematical Sciences, vol. 126, no. 3, pp. 1167-1181. https://doi.org/10.1007/s10958-005-0084-4

APA

Karpov, D. V. (2005). Blocks in k-connected graphs. Journal of Mathematical Sciences, 126(3), 1167-1181. https://doi.org/10.1007/s10958-005-0084-4

Vancouver

Karpov DV. Blocks in k-connected graphs. Journal of Mathematical Sciences. 2005 Jan 1;126(3):1167-1181. https://doi.org/10.1007/s10958-005-0084-4

Author

Karpov, D. V. / Blocks in k-connected graphs. In: Journal of Mathematical Sciences. 2005 ; Vol. 126, No. 3. pp. 1167-1181.

BibTeX

@article{01b91eb71af94be7b2bdefa2f5ab0df7,
title = "Blocks in k-connected graphs",
abstract = "For a k-connected graph, we define the notion of a block by means of local vertex connectivity and prove some properties of blocks that generalize the properties of classical biconnected blocks of a connected graph. We investigate the structure of the decomposition of a k-connected graph by several cuts. Bibliography: 9 titles.",
author = "Karpov, {D. V.}",
year = "2005",
month = jan,
day = "1",
doi = "10.1007/s10958-005-0084-4",
language = "English",
volume = "126",
pages = "1167--1181",
journal = "Journal of Mathematical Sciences",
issn = "1072-3374",
publisher = "Springer Nature",
number = "3",

}

RIS

TY - JOUR

T1 - Blocks in k-connected graphs

AU - Karpov, D. V.

PY - 2005/1/1

Y1 - 2005/1/1

N2 - For a k-connected graph, we define the notion of a block by means of local vertex connectivity and prove some properties of blocks that generalize the properties of classical biconnected blocks of a connected graph. We investigate the structure of the decomposition of a k-connected graph by several cuts. Bibliography: 9 titles.

AB - For a k-connected graph, we define the notion of a block by means of local vertex connectivity and prove some properties of blocks that generalize the properties of classical biconnected blocks of a connected graph. We investigate the structure of the decomposition of a k-connected graph by several cuts. Bibliography: 9 titles.

UR - http://www.scopus.com/inward/record.url?scp=17144427310&partnerID=8YFLogxK

U2 - 10.1007/s10958-005-0084-4

DO - 10.1007/s10958-005-0084-4

M3 - Article

AN - SCOPUS:17144427310

VL - 126

SP - 1167

EP - 1181

JO - Journal of Mathematical Sciences

JF - Journal of Mathematical Sciences

SN - 1072-3374

IS - 3

ER -

ID: 36926067