The tree of cuts and minimal $k$-connected graphs
D. V. Karpov

This publication is cited in the following articles:

1. D. A. Migov, “Dekompozitsiya seti po secheniyam pri raschete ee nadezhnosti”, PDM, 2020, no. 47, 62–86    
2. A. V. Pastor, “O vershinakh stepeni $6$ minimalnogo i minimalnogo po styagivaniyu $6$-svyaznogo grafa”, Kombinatorika i teoriya grafov. XI, Zap. nauchn. sem. POMI, 488, POMI, SPb., 2019, 143–167  
3. A. V. Pastor, “O kriticheskikh trekhsvyaznykh grafakh rovno s dvumya vershinami stepeni 3. Chast 2”, Kombinatorika i teoriya grafov. X, Zap. nauchn. sem. POMI, 475, POMI, SPb., 2018, 137–173  
4. A. V. Pastor, “On critically $3$-connected graphs with exactly two vertices of degree 3. Part 1”, J. Math. Sci. (N. Y.), 236:5 (2019), 532–541    
5. A. V. Pastor, “On a decomposition of a $3$-connected graph into cyclically $4$-edge-connected components”, J. Math. Sci. (N. Y.), 232:1 (2018), 61–83