Connectivity properties of locally semicomplete digraphs
Yubao Guo, Lutz Volkmann · Journal of Graph Theory · 1994
Abstract It is shown that every k‐connected locally semicomplete digraph D with minimum outdegree at least 2k and minimum indegree at least 2k − 2 has at least m = max{2, k} vertices x1, x2, ⃛, xm such that D − xi is k‐connected for i = 1, 2, ⃛, m.