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

Voir la notice de l'article 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.
@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},
     publisher = {mathdoc},
     volume = {450},
     year = {2016},
     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
PB  - mathdoc
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
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2016_450_a6/
%G ru
%F ZNSL_2016_450_a6
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/