Über \((k+1)\)-kritisch \((2k+1)\)-fach zusammenhängende Graphen. (On \((k+1)\)-critically \((2k+1)\)-connected graphs) (Q1110537)

A graph G is called k-critically n-connected iff for each subset V'\(\subseteq V(G)\) with \(| V'| \leq k\) holds that the connectivity of G-V' equals n-\(| V'|\). Slater [\textit{St. B. Maurer} and \textit{P. J. Slater}, Discrete Math. 20, 255-262 (1977; Zbl 0375.05031)] conjectured that there exists no noncomplete \((k+1)\)-critically \((2k+1)\)- connected graph. \textit{Y. O. Hamidoune} [J. Comb. Theory, Ser. B 30, 108- 112 (1981; Zbl 0472.05040)] showed that each noncomplete \((k+1)\)- critically (2k)-connected graph has cordinality at most 3k-1. Improving Hamidoune's method the author shows that each noncomplete \((k+1)\)- critically \((2k+1)\)-connected graph has cardinality at most 3k-1.