Geodesic
Properties of uniformly $3$-connected graphs
Discrete mathematics & theoretical computer science, special issue ICGT'22, Tome 25 (2023-2024) no. 3.

Voir la notice de l'article provenant de la source Episciences

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.
DOI : 10.46298/dmtcs.10407
Classification : 05C07, 05C35, 05C40 
@article{DMTCS_2024_25_3_a5,
     author = {G\"oring, Frank and Hofmann, Tobias},
     title = {Properties of uniformly $3$-connected graphs},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {25},
     number = {3},
     year = {2023-2024},
     doi = {10.46298/dmtcs.10407},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.10407/}
}
TY  - JOUR
AU  - Göring, Frank
AU  - Hofmann, Tobias
TI  - Properties of uniformly $3$-connected graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2023-2024
VL  - 25
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.10407/
DO  - 10.46298/dmtcs.10407
LA  - en
ID  - DMTCS_2024_25_3_a5
ER  - 
%0 Journal Article
%A Göring, Frank
%A Hofmann, Tobias
%T Properties of uniformly $3$-connected graphs
%J Discrete mathematics & theoretical computer science
%D 2023-2024
%V 25
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.10407/
%R 10.46298/dmtcs.10407
%G en
%F DMTCS_2024_25_3_a5
Göring, Frank; Hofmann, Tobias. Properties of uniformly $3$-connected graphs. Discrete mathematics & theoretical computer science, special issue ICGT'22, Tome 25 (2023-2024) no. 3. doi : 10.46298/dmtcs.10407. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.10407/

Cité par Sources :