In this article, we investigate the structure of uniformly k $k$ -connected and -edge-connected graphs. Whereas both types have previously been studied independent each other, analyze relations between these two classes. We prove that any graph is also for ≤ 3 $k\le 3$ demonstrate not case > $k\gt . Furthermore, graphs are well understood 2 2$ it known how to construct 3-edge-connected contribu...