Properties of uniformly 3-connected graphs

MaRDI QIDQ6419050zbMATH OpenFDO

Authors Frank Göring, Tobias Hofmann

Publication date 30 November 2022

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40) Structural characterization of families of graphs (05C75) Extremal combinatorics (05D99)

Abstract: 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.

This page was built for publication: Properties of uniformly $3$-connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6419050)