1. Anderson, J., Lai, H.-J., Lin, X., Xu, M.: On $$k$$-maximal strength digraphs. J. Graph Theory 84, 17–25 (2017)
2. Bahmanian, M.A., S̆ajna, M.: Connection and separation in hypergraphs. Theory Appl. Graphs 2(2), 0–24 (2015)
3. Bernshteyn, A., Kostochka, A.: On the number of edges in a graph with no ($$k+1$$)-connected subgraphs. Discrete Math. 339, 682–688 (2016)
4. Bondy, J.A., Murty, U.S.R.: Graph Theory, Graduate Texts in Mathematics. Springer, Berlin (2008)
5. Chekuri C., Xu C.: Computing minimum cuts in hypergraphs. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Barcelona, 2017), pp. 1085–1100. SIAM (2017)