Properties of uniformly 3-connected graphs

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 constructive characterization of uniformly 3-connected graphs and obtain a more detailed result that relates the number of vertices to the operations involved in constructing a respective uniformly 3-connected graph. Furthermore, we investigate how crossing numbers and treewidths behave under the mentioned constructions. We demonstrate how these results can be utilized to study the structure and properties of uniformly 3-connected graphs with minimum number of vertices of minimum degree.