RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI

Zap. Nauchn. Sem. POMI, 2014, Volume 427, Pages 22–40 (Mi znsl6041)

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

References

1. G. A. Dirac, “Minimally $2$-connected graphs”, J. Reine Angew. Math., 268 (1967), 204–216  mathscinet
2. M. D. Plummer, “On minimal blocks”, Trans. Amer. Math. Soc., 134 (1968), 85–94  crossref  mathscinet  zmath
3. W. T. Tutte, Connectivity in graphs, Univ. Toronto Press, Toronto, 1966  mathscinet  zmath
4. W. Mader, “Ecken Vom Gard $n$ in minimalen $n$-fach zusammenhangenden Graphen”, Arch. Math. (Basel), 23 (1972), 219–224  crossref  mathscinet  zmath
5. W. Mader, “On vertices of degree $n$ in minimally $n$-connected graphs and digraphs”, Combinatorics, Paul Erdös is Eighty, v. 2, Budapest, 1996, 423–449  mathscinet  zmath
6. W. Mader, “Zur Struktur minimal n-fach zusammenhängender Graphen”, Abh. Math. Sem. Univ. Hamburg, 49 (1979), 49–69  crossref  mathscinet  zmath
7. F. Kharari, Teoriya grafov, Mir, Moskva, 1973  mathscinet
8. D. V. Karpov, A. V. Pastor, “Struktura razbieniya trekhsvyaznogo grafa”, Zap. nauchn. semin. POMI, 391, 2011, 90–148  mathnet  mathscinet
9. D. V. Karpov, “Razdelyayuschie mnozhestva v $k$-svyaznom grafe”, Zap. nauchn. semin. POMI, 340, 2006, 33–60  mathnet  mathscinet  zmath
10. D. V. Karpov, “Derevo razbieniya dvusvyaznogo grafa”, Zap. nauchn. semin. POMI, 417, 2013, 86–105  mathnet
11. D. V. Karpov, “Minimalnye $k$-svyaznye grafy s minimalnym chislom vershin stepeni $k$”, Zap. nauchn. semin. POMI, 427, 2014, 41–65  mathnet


© Steklov Math. Inst. of RAS, 2025