The structure of decomposition of a triconnected graph
Combinatorics
2014-05-29 v1
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. Keywords: connectivity, triconneted graphs.
Keywords
Cite
@article{arxiv.1203.0662,
title = {The structure of decomposition of a triconnected graph},
author = {Dmitri Karpov and Alexey Pastor},
journal= {arXiv preprint arXiv:1203.0662},
year = {2014}
}
Comments
49 pages, 8 figures. Russian version published in Zap. Nauchn. Sem. POMI v.391 (2011), http://www.pdmi.ras.ru/znsl/2011/v391/abs090.html