This publication is cited in the following articles:
D. V. Karpov, “ON RECONSTRUCTION OF A GRAPH OF CONNECTIVITY 2 HAVING A 2-VERTEX SET DIVIDING IT INTO AT LEAST 3 PARTS”, J Math Sci, 2026
N. Yu. Vlasova, “EVERY 3-CONNECTED GRAPH WITH AT LEAST 13 VERTICES HAS A CONTRACTIBLE SET WITH 5 VERTICES”, J Math Sci, 2026
D. V. Karpov, “On Semi-Reconstruction of Graphs of Connectivity 2”, J Math Sci, 275:2 (2023), 163
N. Yu. Vlasova, “Kazhdyi $3$-svyaznyi graf na ne menee chem $13$ vershinakh imeet styagivaemyi $5$-vershinnyi podgraf”, Kombinatorika i teoriya grafov. XIII, Zap. nauchn. sem. POMI, 518, POMI, SPb., 2022, 5–93
D. V. Karpov, “O rekonstruktsii grafov svyaznosti $2$ s $2$-vershinnym mnozhestvom, delyaschim graf khotya by na $3$ chasti”, Kombinatorika i teoriya grafov. XIII, Zap. nauchn. sem. POMI, 518, POMI, SPb., 2022, 124–151
Karpov V D., “Large Contractible Subgraphs of a 3-Connected Graph”, Discuss. Math. Graph Theory, 41:1 (2021), 83–101
D. V. Karpov, “On semi-reconstruction of graphs of connectivity $2$”, Kombinatorika i teoriya grafov. XII, Zap. nauchn. sem. POMI, 497, POMI, SPb., 2020, 80–99
N. Yu. Vlasova, “O styagivaemykh 5-vershinnykh podgrafakh trekhsvyaznogo grafa”, Kombinatorika i teoriya grafov. X, Zap. nauchn. sem. POMI, 475, POMI, SPb., 2018, 22–40
D. V. Karpov, “O strukture trekhsvyaznogo grafa. 2”, Kombinatorika i teoriya grafov. X, Zap. nauchn. sem. POMI, 475, POMI, SPb., 2018, 41–92
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
D. V. Karpov, “Decomposition of a $2$-connected graph into three connected subgraphs”, J. Math. Sci. (N. Y.), 236:5 (2019), 490–502
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
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
D. V. Karpov, “The tree of cuts and minimal $k$-connected graphs”, J. Math. Sci. (N. Y.), 212:6 (2016), 654–665
D. V. Karpov, “Deleting vertices from a biconnected graph with preserving biconnectinity”, J. Math. Sci. (N. Y.), 212:6 (2016), 683–687
D. V. Karpov, “Minimal biconnected graphs”, J. Math. Sci. (N. Y.), 204:2 (2015), 244–257
