|
Zapiski Nauchnykh Seminarov POMI, 2011, Volume 391, Pages 45–78
(Mi znsl4568)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Generalized flowers in $k$-connected graph
A. L. Glazmanab a St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences, St. Petersburg, Russia
b Section de Mathématiques, Université de Genéve, Genéve, Suisse
Abstract:
In this article we research $k$-cutsets in $k$-connected graphs. We introduce generalized flowers and prove some fundamental statements describing their structure. After this we consider generalized flowers in case $k=4$. When $k=4$ we give a complete description of $4$-cutsets lying in a generalized flower.
Key words and phrases:
$k$-connected graph, $4$-connected graph, cutset.
Received: 07.11.2011
Citation:
A. L. Glazman, “Generalized flowers in $k$-connected graph”, Combinatorics and graph theory. Part III, Zap. Nauchn. Sem. POMI, 391, POMI, St. Petersburg, 2011, 45–78; J. Math. Sci. (N. Y.), 184:5 (2012), 579–594
Linking options:
https://www.mathnet.ru/eng/znsl4568 https://www.mathnet.ru/eng/znsl/v391/p45
|
Statistics & downloads: |
Abstract page: | 271 | Full-text PDF : | 61 | References: | 54 |
|