|
Zapiski Nauchnykh Seminarov POMI, 2011, Volume 391, Pages 90–148
(Mi znsl4570)
|
|
|
|
This article is cited in 9 scientific papers (total in 9 papers)
The structure of decomposition of a triconnected graph
D. V. Karpov, A. V. Pastor St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences, St. Petersburg, Russia
Abstract:
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of all complexes is presented. Moreover, we prove that the structure of a hypertree could be introduced on the set of all complexes. This structure gives us a complete description of the relative disposition of the complexes.
Key words and phrases:
connectivity, triconneted graphs.
Received: 14.09.2011
Citation:
D. V. Karpov, A. V. Pastor, “The structure of decomposition of a triconnected graph”, Combinatorics and graph theory. Part III, Zap. Nauchn. Sem. POMI, 391, POMI, St. Petersburg, 2011, 90–148; J. Math. Sci. (N. Y.), 184:5 (2012), 601–628
Linking options:
https://www.mathnet.ru/eng/znsl4570 https://www.mathnet.ru/eng/znsl/v391/p90
|
Statistics & downloads: |
Abstract page: | 297 | Full-text PDF : | 95 | References: | 54 |
|