1 paper · 1 filter
Frank Göring, Tobias Hofmann
A graph on at least k+1 vertices is uniformly k-connected if each pair of its vertices is connected by k and not more than k independent paths. We reinvestigate a recent…