A constructive characterization of uniformly 4-connected graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911049311059968 |
|---|---|
| author | Chen, Xiang Kou, Shuai Qin, Chengfu Xu, Liqiong Yang, Weihua |
| author_facet | Chen, Xiang Kou, Shuai Qin, Chengfu Xu, Liqiong Yang, Weihua |
| contents | A constructive characterization of the class of uniformly $4$-connected graphs is presented. The characterization is based on the application of graph operations to appropriate vertex and edge sets in uniformly $4$-connected graphs, that is, any uniformly $4$-connected graph can be obtained from $C_5^2$ or $C_6^2$ by a number of $Δ_1^+$ or $Δ_2^+$-operations to quasi $4$-compatible sets. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_07656 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A constructive characterization of uniformly 4-connected graphs Chen, Xiang Kou, Shuai Qin, Chengfu Xu, Liqiong Yang, Weihua Combinatorics A constructive characterization of the class of uniformly $4$-connected graphs is presented. The characterization is based on the application of graph operations to appropriate vertex and edge sets in uniformly $4$-connected graphs, that is, any uniformly $4$-connected graph can be obtained from $C_5^2$ or $C_6^2$ by a number of $Δ_1^+$ or $Δ_2^+$-operations to quasi $4$-compatible sets. |
| title | A constructive characterization of uniformly 4-connected graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2507.07656 |