Strengthened chain theorems for different versions of 4-connectivity
Combinatorics
2020-12-29 v1
Abstract
The chain theorem of Tutte states that every 3-connected graph can be constructed from a wheel 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 by repeatedly adding edges and splitting vertices. In this paper we similarly strengthen several chain theorems for various versions of 4-connectivity.
Cite
@article{arxiv.2012.13974,
title = {Strengthened chain theorems for different versions of 4-connectivity},
author = {Guoli Ding and Chengfu Qin},
journal= {arXiv preprint arXiv:2012.13974},
year = {2020}
}