A note on -free graphs and -free graphs
arXiv:2102.07706
Abstract
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-connected graph is -free if and only if it is , or it is obtained from by repeatedly 4-splitting vertices. We also show that a planar graph is -free if and only if it is constructed by repeatedly taking 0-, 1-, 2-sums starting from , where is the set of graphs obtained by repeatedly taking the special 3-sums of . For , we prove that a 4-connected graph is -free if and only if it is planar, , or it is obtained from by repeatedly 4-splitting vertices.
13 page