Document Type
Article
Publication Date
1-1-2022
Abstract
The chain theorem of Tutte states that every 3-connected graph can be constructed from a wheel Wn by repeatedly adding edges and splitting vertices. It is not difficult to prove the following strengthening of this theorem: every non-wheel 3-connected graph can be constructed from W4 by repeatedly adding edges and splitting vertices. In this paper, we similarly strengthen several chain theorems for various versions of 4-connectivity.
Publication Source (Journal or Book title)
Discrete Mathematics
Recommended Citation
Ding, G., & Qin, C. (2022). Strengthened chain theorems for different versions of 4-connectivity. Discrete Mathematics, 346 (1) https://doi.org/10.1016/j.disc.2022.113129
COinS