Geodesic
On a decomposition of a $3$-connected graph into cyclically $4$-edge-connected components
Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part VIII, Tome 450 (2016), pp. 109-150 
A. V. Pastor. On a decomposition of a $3$-connected graph into cyclically $4$-edge-connected components. Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part VIII, Tome 450 (2016), pp. 109-150. http://geodesic.mathdoc.fr/item/ZNSL_2016_450_a6/
@article{ZNSL_2016_450_a6,
     author = {A. V. Pastor},
     title = {On a~decomposition of a~$3$-connected graph into cyclically $4$-edge-connected components},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {109--150},
     year = {2016},
     volume = {450},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2016_450_a6/}
}
TY  - JOUR
AU  - A. V. Pastor
TI  - On a decomposition of a $3$-connected graph into cyclically $4$-edge-connected components
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2016
SP  - 109
EP  - 150
VL  - 450
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2016_450_a6/
LA  - ru
ID  - ZNSL_2016_450_a6
ER  - 
%0 Journal Article
%A A. V. Pastor
%T On a decomposition of a $3$-connected graph into cyclically $4$-edge-connected components
%J Zapiski Nauchnykh Seminarov POMI
%D 2016
%P 109-150
%V 450
%U http://geodesic.mathdoc.fr/item/ZNSL_2016_450_a6/
%G ru
%F ZNSL_2016_450_a6

Voir la notice du chapitre de livre provenant de la source Math-Net.Ru

A graph is called cyclically $4$-edge-connected if removing any three edges from it leads us to a graph, at most one connected component of which contains a cycle. $3$-connected graph is $4$-edge-connected iff removing any three edges from it leads us to either a connected graph or to a graph with exactly two connected components, one of which is a single-vertex one. We show, how to correspond for any $3$-connected graph a components tree, such that every component would be a $3$-connected and cyclically $4$-edge-connected graph.

[1] D. V. Karpov, “Bloki v $k$-svyaznykh grafakh”, Zap. nauchn. semin. POMI, 293, 2002, 59–93 | MR | Zbl

[2] D. V. Karpov, “Razdelyayuschie mnozhestva v $k$-svyaznom grafe”, Zap. nauchn. semin. POMI, 340, 2006, 33–60 | MR | Zbl

[3] D. V. Karpov, “Derevo razbieniya dvusvyaznogo grafa”, Zap. nauchn. semin. POMI, 417, 2013, 86–105

[4] D. V. Karpov, “Derevo razrezov i minimalnyi $k$-svyaznyi graf”, Zap. nauchn. semin. POMI, 427, 2014, 22–40

[5] D. V. Karpov, A. V. Pastor, “O strukture $k$-svyaznogo grafa”, Zap. nauchn. semin. POMI, 266, 2000, 76–106 | MR | Zbl

[6] D. V. Karpov, A. V. Pastor, “Struktura razbieniya trekhsvyaznogo grafa”, Zap. nauchn. semin. POMI, 391, 2011, 90–148

[7] F. Kharari, Teoriya grafov, “Mir”, Moskva, 1973; F. Harary, Graph theory, 1969 | MR

[8] W. Hohberg, “The decomposition of graphs into $k$-connected components”, Discr. Math., 109 (1992), 133–145 | DOI | MR | Zbl

[9] W. T. Tutte, Connectivity in graphs, Univ. Toronto Press, Toronto, 1966 | MR | Zbl