2 papers
math.CO2021
A note on -free graphs and -free graphs
Wenjian Jia, Shuai Kou, Chengfu Qin +1
Let and be the planar and non-planar graphs that obtained from the Octahedron by 3-splitting a vertex respectively. For , we prove that a 4…
math.CO2020
Strengthened chain theorems for different versions of 4-connectivity
Guoli Ding, Chengfu Qin
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…